counting complexity class

If 𝒩𝒞 is a complexity classPlanetmathPlanetmath associated with non-deterministic machines then #𝒞={#RR𝒩𝒞} is the set of counting problems associated with each search problem in 𝒩𝒞. In particular, #𝒫 is the class of counting problems associated with 𝒩𝒫 search problems.

Title counting complexity class
Canonical name CountingComplexityClass
Date of creation 2013-03-22 13:02:31
Last modified on 2013-03-22 13:02:31
Owner Henry (455)
Last modified by Henry (455)
Numerical id 4
Author Henry (455)
Entry type Definition
Classification msc 68Q15