tags:

views:

198

answers:

0
+2  Q: 

P≠NP - Is this solved?

Possible Duplicate:
Explain the proof by Vinay Deolalikar that P != NP.

Hi,

I've just received this link, to a newly-published article of an HP researcher. The article presents a proof to the P≠NP theorem.

Wikipedia has an article about the author, and slashdot has published another article.

Is this true?

related questions

What's "P=NP?", and why is it such a famous question?
How does Jan Willem Klop's "(L L L...)" Y combinator work?
What College/Univ has the best computer science/software engineering program?
What CS class has helped you over and over?
What's the best source to learn about database replication mechanisms?
What can a coder-at-heart do to survive the "real world"?
What can a coder-at-heart do to survive earning a Computer Science degree?
What is a y-combinator?
What do you think about the loss of MIT's 6.001 (SICP) course?
What are futures?
What is round-robin scheduling?
What is a multitasking operating system?
Prim's Algorithm, Priority First Search and Minimum Spanning Trees (MST)
Spatial Data Structures in C
Hardest Programming discipline?
Good text on order analysis
Modern books on algorithms
Recommended resources for computer science theory.
What is a 'Closure'?
What is 'Currying'?
What languages should I learn before University?
What is a lambda (function)?
Computer science textbooks
What kinds of non-technical courses should a software engineer or computer scientist take?
What is recursion and when should I use it?