Quantitative relativizations of complexity classes
SIAM Journal on Computing
The Boolean hierarchy I: structural properties
SIAM Journal on Computing
A uniform approach to define complexity classes
Theoretical Computer Science
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
More on BPP and the polynomial-time hierarchy
Information Processing Letters
Functions computable with limited access to NP
Information Processing Letters
Computing Solutions Uniquely Collapses the Polynomial Hierarchy
SIAM Journal on Computing
The complexity of obtaining solutions for problems in NP and NL
Complexity theory retrospective II
A hierarchy based on output multiplicity
Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
A note on parallel queries and the symmetric-difference hierarchy
Information Processing Letters
New Collapse Consequences of NP Having Small Circuits
SIAM Journal on Computing
SIAM Journal on Computing
Symmetric alternation captures BPP
Computational Complexity
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Open questions in the theory of semifeasible computation
ACM SIGACT News
Survey: The consequences of eliminating NP solutions
Computer Science Review
| Hi-index | 0.00 |
We study whether one can prune solutions from NP functions. Though it is known that, unless surprising complexity class collapses occur, one cannot reduce the number of accepting paths of NP machines, we nonetheless show that it often is possible to reduce the number of solutions of NP functions. For finite cardinality types, we give a sufficient condition for such solution reduction. We also give absolute and conditional necessary conditions for solution reduction, and in particular we show that in many cases solution reduction is impossible unless the polynomial hierarchy collapses.