Abstract
We show that if there is an NP function that, when given a satisfiable formula as input, outputs one satisfying assignment uniquely, then the polynomial hierarchy collapses to its second level. As the existence of such a function is known to be equivalent to the statement “every NP function has an NP refinement with unique outputs,” our result provides the strongest evidence yet that NP functions cannot be refined.
Cite
CITATION STYLE
Hemaspaandra, L. A., Naik, A. V., Ogihara, M., & Selman, A. L. (1994). Computing solutions uniquely collapses the polynomial hierarchy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 57–64). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_166
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
