Some observations on the connection between counting and recursion
Theoretical Computer Science
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
Acta Informatica
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Polynomial-time 1-Turing reductions from #PH to #P
Theoretical Computer Science
Descriptive complexity of #P functions
Journal of Computer and System Sciences
The Markov chain Monte Carlo method: an approach to approximate counting and integration
Approximation algorithms for NP-hard problems
The Complexity of Computing the Size of an Interval
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On Different Reducibility Notions for Function Classes
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
On some central problems in computational complexity.
On some central problems in computational complexity.
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
Complexity of Counting the Optimal Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
On the Connection between Interval Size Functions and Path Counting
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Complexity of counting the optimal solutions
Theoretical Computer Science
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
We investigate the complexity of counting problems that belong to the complexity class #P and have an easy decision version. These problems constitute the class #PE which has some well-known representatives such as #Perfect Matchings, #DNF-Sat, and NonNegative Permanent. An important property of these problems is that they are all #P-complete, in the Cook sense, while they cannot be #P-complete in the Karp sense unless P = NP. We study these problems in respect to the complexity class TotP, which contains functions that count the number of all paths of a PNTM. We first compare TotP to #P and #PE and show that FP⊆TotP⊆#PE⊆#P and that the inclusions are proper unless P = NP. We then show that several natural #PE problems — including the ones mentioned above — belong to TotP. Moreover, we prove that TotP is exactly the Karp closure of self-reducible functions of #PE. Therefore, all these problems share a remarkable structural property: for each of them there exists a polynomial-time nondeterministic Turing machine which has as many computation paths as the output value.