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

Write the missing intermediate account

There is room for a treatment that assumes mathematical maturity and no complexity background, covering reductions, completeness and the barriers properly in fifty pages. Several people have tried it in lecture notes and none of it is easy to find.
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).Send light bulbs to show you like this suggestion!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.