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

There is no good intermediate treatment between popular and graduate

The articles are too loose and the textbooks assume a term of formal machinery. Someone with a mathematical background and no complexity theory has nowhere obvious to go, and that gap is wide.
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.