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 [17], 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.
CITATION STYLE
Hemaspaandra, L. A., Ogihara, M., & Wechsung, G. (2000). Reducing the number of solutions of NP functions? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1893, pp. 394–404). Springer Verlag. https://doi.org/10.1007/3-540-44612-5_35
Mendeley helps you to discover research relevant for your work.