Computing solutions uniquely collapses the polynomial hierarchy

Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationAlgorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings
PublisherSpringer Verlag
Pages57-64
Number of pages8
Volume834 LNCS
ISBN (Print)9783540583257
StatePublished - 1994
Externally publishedYes
Event5th Annual International Symposium on Algorithms and Computation, ISAAC 1994 - Beijing, China
Duration: Aug 25 1994Aug 27 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume834 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th Annual International Symposium on Algorithms and Computation, ISAAC 1994
CountryChina
CityBeijing
Period8/25/948/27/94

Fingerprint

Polynomial Hierarchy
Polynomials
Computing
Output
Refinement
Assignment

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Hemaspaandra, L. A., Naik, A. V., Ogihara, M., & Selman, A. L. (1994). Computing solutions uniquely collapses the polynomial hierarchy. In Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings (Vol. 834 LNCS, pp. 57-64). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 834 LNCS). Springer Verlag.

Computing solutions uniquely collapses the polynomial hierarchy. / Hemaspaandra, Lane A.; Naik, Ashish V.; Ogihara, Mitsunori; Selman, Alan L.

Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. Vol. 834 LNCS Springer Verlag, 1994. p. 57-64 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 834 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hemaspaandra, LA, Naik, AV, Ogihara, M & Selman, AL 1994, Computing solutions uniquely collapses the polynomial hierarchy. in Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. vol. 834 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 834 LNCS, Springer Verlag, pp. 57-64, 5th Annual International Symposium on Algorithms and Computation, ISAAC 1994, Beijing, China, 8/25/94.
Hemaspaandra LA, Naik AV, Ogihara M, Selman AL. Computing solutions uniquely collapses the polynomial hierarchy. In Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. Vol. 834 LNCS. Springer Verlag. 1994. p. 57-64. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Hemaspaandra, Lane A. ; Naik, Ashish V. ; Ogihara, Mitsunori ; Selman, Alan L. / Computing solutions uniquely collapses the polynomial hierarchy. Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. Vol. 834 LNCS Springer Verlag, 1994. pp. 57-64 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{f4eb64f0371b4f4a95f5860b15e59bda,
title = "Computing solutions uniquely collapses the polynomial hierarchy",
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.",
author = "Hemaspaandra, {Lane A.} and Naik, {Ashish V.} and Mitsunori Ogihara and Selman, {Alan L.}",
year = "1994",
language = "English (US)",
isbn = "9783540583257",
volume = "834 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "57--64",
booktitle = "Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings",

}

TY - GEN

T1 - Computing solutions uniquely collapses the polynomial hierarchy

AU - Hemaspaandra, Lane A.

AU - Naik, Ashish V.

AU - Ogihara, Mitsunori

AU - Selman, Alan L.

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79151486077&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79151486077&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:79151486077

SN - 9783540583257

VL - 834 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 57

EP - 64

BT - Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings

PB - Springer Verlag

ER -