P vs NP Debate
The cluster focuses on discussions about the P versus NP problem, including skepticism toward claimed proofs, explanations of NP-complete problems, and implications for computational complexity.
Activity Over Time
Top Contributors
Keywords
Sample Comments
Aren't there lots of NP problems that have this property?
What you are saying is P/=NP
Is proving P = NP equivalent to knowing how any intractable problem can be solved? Is it possible for P=NP and yet a class of intractable problems to remain unsolved?
Well, P/NP really has almost no bearing on this problem. That is a theoretical problem and even if P=NP, the algorithm could have a ginormous constant or degree. Conversely even if P=/=NP, the problem might be very easy to solve at human timescales with advanced enough algorithms/processing speed.
You're saying P=NP, I think.
Can you describe an np complete problem that you have solved?
Provided, of course, that P != NP.
Not a physics problem : https://en.wikipedia.org//wiki/P_versus_NP_problem
This looks like one of those P versus NP papers.
We don't even know for sure that P≠NP