counting complexity class
If is a complexity class associated with non-deterministic machines then 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|
|Date of creation||2013-03-22 13:02:31|
|Last modified on||2013-03-22 13:02:31|
|Last modified by||Henry (455)|