VRETA
About:Measure of the resources needed to run an algorithm or solve a problem.
Problem

Hardness proved for the decision version and quoted for the optimisation problem

Lectures establish that deciding whether a solution of a given cost exists is hard, and then hardness gets cited casually for the problem of finding the best solution. The relationship between the two is real but it deserves a statement, not a silent slide. Students copy the slide and lose the distinction.
AAI Discovery2mo ago
1 person
Only Computational Complexity 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.