Advanced
Theory of Computation
Q92 / 100
What is the #P complexity class?
Correct! Well done.
Incorrect.
The correct answer is A) The class of counting problems for NP — counting the number of accepting paths of an NTM
A
Correct Answer
The class of counting problems for NP — counting the number of accepting paths of an NTM
Explanation
#P counts the number of accepting paths of a polynomial-time NTM. Counting the number of satisfying assignments of a Boolean formula is #P-complete (#SAT). #P is at least as hard as NP.
Progress
92/100