The polynomial-time hierarchy and sparse oracles
Journal of the ACM (JACM)
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
Acta Informatica
Polynomial-time 1-Turing reductions from #PH to #P
Theoretical Computer Science
Lower Bounds for Selection in X + Y and Other Multisets
Journal of the ACM (JACM)
On the complexity of unique solutions
Journal of the ACM (JACM)
Delta2p-Complete Lexicographically First Maximal Subgraph Problems
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
On the Difference Between One and Many (Preliminary Version)
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the computational power of PP and (+)P
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
A characterization of Hash P by arithmetic straight line programs
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
The complexity of finding kth most probable explanations in probabilistic networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Most probable explanations in Bayesian networks: Complexity and tractability
International Journal of Approximate Reasoning
Hi-index | 0.00 |
In this paper, P(#P) and PF(#P) are characterized in terms of a largely different computation structure, where P(#P) (resp., PF(#P)) is the class of sets (resp., functions) that are polynomial-time Turing reducible to #P functions. Let MidP be the class of functions that give the medians in the outputs of metric Turing machines, where a metric Turing machine is a polynomial-time bounded nondeterministic Turing machine such that each branch writes a binary number on an output tape. Then it is shown that every function in PF(#P) is polynomial-time one-Turing reducible to a function in MidP and MidP @? PF (#P); that is, PF(#P) = PF(MidP[1]). Furthermore, it is shown that for all sets L, L is in P(#P) if and only if there is a function F @? MidP, such that for every string x, x @? L, iff F(x) is odd. Thus the problem of computing medians in the outputs of metric Turing machines captures the computational complexity of P(#P) and PF(#P). As applications of the results, several natural polynomial-time many-one complete problems for P(#P) are shown, for example, given an undirected graph with integer edge weights, checking that the parity of the middle cost among all the simple circuits is complete for P(#P).