♯P

The correct title of this article is #P. The substitution of the # is due to technical restrictions.

In computational complexity theory, the complexity class #P (pronounced "sharp P" or, sometimes "number P" or "hash P") is the set of the counting problems associated with the decision problems in the set NP. More formally, #P is the class of function problems of the form "compute f(x)", where f is the number of accepting paths of a nondeterministic Turing machine running in polynomial time. Unlike most well-known complexity classes, it is not a class of decision problems but a class of function problems. The most difficult, representative problems of this class are #P-complete.

Relation to decision problems

An NP decision problem is often of the form "Are there any solutions that satisfy certain constraints?" For example:

• Are there any subsets of a list of integers that add up to zero? (subset sum problem)
• Are there any Hamiltonian cycles in a given graph with cost less than 100? (traveling salesman problem)
• Are there any variable assignments that satisfy a given CNF (conjunctive normal form) formula? (Boolean satisfiability problem or SAT)
• Does a univariate real polynomial have any positive roots? (Root finding)

The corresponding #P function problems ask "how many" rather than "are there any". For example:

• How many subsets of a list of integers add up to zero?
• How many Hamiltonian cycles in a given graph have cost less than 100?
• How many variable assignments satisfy a given CNF formula?
• How many roots of a univariate real polynomial are positive?

Related complexity classes

Clearly, a #P problem must be at least as hard as the corresponding NP problem. If it's easy to count answers, then it must be easy to tell whether there are any answers—just count them and see whether the count is greater than zero. Some of these problems, such as root finding, are easy enough to be in FP, while others are #P-complete.

One consequence of Toda's theorem is that a polynomial-time machine with a #P oracle (P^#P) can solve all problems in PH, the entire polynomial hierarchy. In fact, the polynomial-time machine only needs to make one #P query to solve any problem in PH. This is an indication of the extreme difficulty of solving #P-complete problems exactly.

Surprisingly, some #P problems that are believed to be difficult correspond to easy (for example linear-time) P problems. For more information on this, see #P-complete.

The closest decision problem class to #P is PP, which asks whether a majority (more than half) of the computation paths accept. This finds the most significant bit in the #P problem answer. The decision problem class ⊕P (pronounced "Parity-P") instead asks for the least significant bit of the #P answer.

Formal definitions

#P is formally defined as follows:

#P is the set of all functions ${\displaystyle f:\{0,1\}^{*}\to \mathbb {N} }$ such that there is a polynomial time nondeterministic Turing machine ${\displaystyle M}$ such that for all ${\displaystyle x\in \{0,1\}^{*}}$, ${\displaystyle f(x)}$ equals the number of accepting branches in ${\displaystyle M}$'s computation graph on ${\displaystyle x}$.^[1]

#P can also be equivalently defined in terms of a verifer. A decision problem is in NP if there exists a polynomial-time checkable certificate to a given problem instance—that is, NP asks whether there exists a proof of membership for the input that can be checked for correctness in polynomial time. The class #P asks how many certificates there exist for a problem instance that can be checked for correctness in polynomial time.^[1] In this context, #P is defined as follows:

#P is the set of functions ${\displaystyle f:\{0,1\}^{*}\to \mathbb {N} }$ such that there exists a polynomial ${\displaystyle p:\mathbb {N} \to \mathbb {N} }$ and a polynomial-time deterministic Turing machine ${\displaystyle V}$, called the verifier, such that for every ${\displaystyle x\in \{0,1\}^{*}}$, ${\displaystyle f(x)={\Big |}{\big \{}y\in \{0,1\}^{p(|x|)}:V(x,y)=1{\big \}}{\Big |}}$.^[2] (In other words, ${\displaystyle f(x)}$ equals the size of the set containing all of the polynomial-size certificates).

History

The complexity class #P was first defined by Leslie Valiant in a 1979 article on the computation of the permanent of a square matrix, in which he proved that permanent is #P-complete.^[3]

Larry Stockmeyer has proved that for every #P problem ${\displaystyle P}$ there exists a randomized algorithm using an oracle for SAT, which given an instance ${\displaystyle a}$ of ${\displaystyle P}$ and ${\displaystyle \epsilon >0}$ returns with high probability a number ${\displaystyle x}$ such that ${\displaystyle (1-\epsilon )P(a)\leq x\leq (1+\epsilon )P(a)}$.^[4] The runtime of the algorithm is polynomial in ${\displaystyle a}$ and ${\displaystyle 1/\epsilon }$. The algorithm is based on the leftover hash lemma.

See also

• Computer programming portal

• Quantum_computing#Relation_to_computability_and_complexity_theory – Technology that uses quantum mechanics

References

1. Barak, Boaz (Spring 2006). "Complexity of counting" (PDF). Computer Science 522: Computational Complexity. Princeton University.
2. Arora, Sanjeev; Barak, Boaz (2009). Computational Complexity: A Modern Approach. Cambridge University Press. p. 344. ISBN 978-0-521-42426-4.
3. Leslie G. Valiant (1979). "The Complexity of Computing the Permanent". Theoretical Computer Science. 8 (2). Elsevier: 189–201. doi:10.1016/0304-3975(79)90044-6.
4. Stockmeyer, Larry (November 1985). "On Approximation Algorithms for #P" (PDF). SIAM Journal on Computing. 14 (4): 849–861. doi:10.1137/0214060. Archived from the original (PDF) on 2009-10-28.

External links

• Complexity Zoo: Class #P