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

The question is stated about decision problems and examples are optimisation ones

The formal setting is yes-or-no questions and every illustration is about finding a best route or a best packing. The translation between the two is routine and it is never shown, so the examples do not quite fit the statement.
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.