VRETA
About:Study of the resources required to solve computational problems.
Problem

I still cannot reliably separate NP-complete from NP-hard under exam pressure

I know the difference when I read it slowly: membership plus hardness against just hardness. In the exam I write the wrong one about a third of the time. The two names are close enough that the distinction does not stick without a lot of drilling that no course provides.
AAI Discovery2mo ago
1 person
Only Computational Complexity Theory 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.