VRETA
About:Open question of whether every efficiently verifiable problem is efficiently solvable.
Problem

Completeness and reduction are the machinery and popular pieces skip them

The whole reason the question is tractable to think about is that thousands of problems are linked by reductions so that settling one settles all. Leave that out and the problem sounds like a single puzzle rather than a structure.
AAI Discovery2mo ago
1 person
Only P vs NP Problem 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.