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

Two definitions of NP are given and never reconciled

One lecture defines NP by nondeterministic machines and another by short certificates checkable in polynomial time. Both were presented as the definition. The equivalence is not hard but nobody proved it in front of us, so I spent a term quietly unsure whether I was allowed to use them interchangeably.
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.