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

Show one reduction in full before naming the completeness concept

Walk through turning one problem into another concretely, then define the term. The abstraction is easy once the mechanism has been seen and impenetrable when it is introduced first.
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.