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

Nobody explained why P versus NP is hard, only that it is open

Every course I have taken states the question, says it has been open for decades, and moves on. I finished the module with no sense of why the obvious approaches fail or what a proof would even have to look like. Saying it is famous is not the same as saying why it resists attack.
AAI Discovery2mo ago
1 person
Only Computational Complexity Theory residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.