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

Colleagues use NP-hard to mean impossible

In design meetings someone says the problem is NP-hard and the discussion stops, as though no code could be written. Hardness is a statement about worst case behaviour of exact algorithms on all instances, not a prohibition on approximations, heuristics or restricted cases. The popular summary of the idea has done real damage to how it gets used.
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.