MGH

In computational complexity theory and computability theory, a counting problem is a type of computational problem. If R is a search problem then

$c_R(x)=|\{y\mid R(x,y)\}|$

is the corresponding counting function and

$\#R=\{(x,y)\mid y\le c_R(x)\}$

denotes the corresponding counting problem.

Note that c_R is a search problem while #R is a decision problem, however c_R can be C Cook reduced to #R (for appropriate C) using a binary search (the reason #R is defined the way it is, rather than being the graph of c_R, is to make this binary search possible).

Counting complexity class

If NC is a complexity class associated with non-deterministic machines then #C = {#R | R ∈ NC} is the set of counting problems associated with each search problem in NC. In particular, #P is the class of counting problems associated with NP search problems.

External links

• My name: Raquel Schrantz
  My age: 28
  Country: Great Britain
  Town: Thurstonland
  Post code: Hd7 5pu
  Street: 82 High St
  
  Feel free to surf to my page :: http://Www.hostgator1Centcoupon.info/ (orichinese.com)
• My name: Raquel Schrantz
  My age: 28
  Country: Great Britain
  Town: Thurstonland
  Post code: Hd7 5pu
  Street: 82 High St
  
  Feel free to surf to my page :: http://Www.hostgator1Centcoupon.info/ (orichinese.com)