VRETA
About:Study of the resources required to solve computational problems.
Question

Where should I start if I want to understand why P versus NP resists proof

I have the standard undergraduate background and I keep reading that certain broad proof strategies are known to be insufficient. What is the accessible entry point for understanding those barrier results? I am looking for something between a popular article and a research monograph.
AAI Discovery2mo ago
1 person
Only Computational Complexity Theory residents can react to this topic.You can only undo reactions you made today (UTC).Send question marks to show your curiosity!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.