Breaking news some one here proved P=NP problem!

Fine print: For the case N=1

12 Responses to “P=NP”

  1. 1 Davis Stuteville April 15, 2018 at 2:46 am

    Superb read, I just passed this onto a colleague who was doing a little study on that. And he actually bought me lunch because I located it for him smile So let me rephrase that: Thanks for lunch!

  2. 2 trojan ribbed April 4, 2018 at 7:58 pm

    magnificent post, very informative. I wonder why the other specialists of this sector do not notice this. You should continue your writing. I’m confident, you have a huge readers’ base already!

  3. 3 franchise opportunities in nj February 28, 2018 at 10:41 am

    I am really enjoying the theme/design of your blog. Do you ever run into any web browser compatibility problems? A small number of my blog readers have complained about my site not working correctly in Explorer but looks great in Safari. Do you have any ideas to help fix this issue?

  4. 4 Manhattan Beach Marketing September 4, 2017 at 4:47 pm

    Your perspective is beyond refreshing. Spot on with this post. I am impressed, I have to say. I found your article on my Google feed. Thank you for sharing your info.

  5. 5 Jesse Grillo September 2, 2017 at 6:30 am

    You remind me of my neighbor. You have a good head on your shoulders.

  6. 6 technology adviser September 1, 2017 at 11:53 pm

    You have brought up a very superb points Can you tell us more about this?

  7. 7 Jesse Grillo August 31, 2017 at 4:52 am

    When I started my browser this site was running. I simply have to tell you that your blogs are really valuable.

  8. 9 S.Karthikeyan July 13, 2006 at 12:08 pm

    So here it goes, a brief summary of what P and NP are.

    What is computational complexity ?
    Computational complexity theory is part of the theory of computation dealing with the resources required during computation to solve a given problem. The most common resources are time (how many steps does it take to solve a problem) and space (how much memory does it take to solve a problem).

    In this theory, the class P consists of all those decision problems that can be solved on a deterministic sequential machine in an amount of time that is polynomial in size of the input.

    The class NP consist of all those decision problems whose positive solutions can be verified in polynomial time given the right information or equivalently, whose solution can be found in polynomial time on a non-deterministic machine.

    More info in wiki.

  9. 10 shocking July 12, 2006 at 8:32 pm

    have a glossary of the jargons you use.
    what is P and NP in this context?

  10. 11 S.Karthikeyan July 12, 2006 at 6:36 pm

    Gp. It’s supposed to be funny (pun) if you can solve the P=NP problem then you can grab the 1 million dollar prize at Clay Maths institute.


  11. 12 Gp July 12, 2006 at 6:31 pm

    okay…was this post supposed to b funny? or….I kno its true.

Leave a Reply to Davis Stuteville Cancel reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s


Thru Lens


View Karthikeyan S's profile on LinkedIn
Alltop, confirmation that we kick ass

%d bloggers like this: