Complexity Flashcards
1
Q
What are the P and NP complexity classes?
A
2
Q
When is a problem in NP?
A
3
Q
When is a formula satisfiable? Is this in P or NP.
In propositional logic
A
4
Q
What is NP-completeness?
A
5
Q
How can P=NP be proven?
A
6
Q
When is a problem co-NP?
A
7
Q
What are the complexity space classes PSpace and NPSpace?
A
