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

Hard instances and hard problems get conflated in teaching

A problem being in a hard class says nothing about whether the instances you meet are hard. Solvers routinely dispatch enormous cases of famously difficult problems, and students who miss this treat the classification as a prohibition.
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.