Quoted By:
No one believes NP-complete is the same as P. A disproof would require one to demonstrate that a single NP-complete problem is actually a P program. We are unlikely to demonstrate this because through mathematical analysis, we can see the NP-complete problems are intractable
