Computing solutions uniquely collapses the polynomial hierarchy

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

Research output: Contribution to journalArticle

39 Citations (Scopus)

Abstract

Is there an NP function that, when given a satisfiable formula as input, outputs one satisfying assignment uniquely? That is, can a nondeterministic function cull just one satisfying assignment from a possibly exponentially large collection of assignments? We show that if there is such a nondeterministic function, then the polynomial hierarchy collapses to ZPPNP (and thus, in particular, to NPNP). Because 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. We prove our result via a result of independent interest. We say that a set A is NPSV-selective (NPMV-selective) if there is a 2-ary partial NP function with unique values (a 2-ary partial NP function) that decides which of its inputs (if any) is "more likely" to belong to A; this is a nondeterministic analog of the recursion-theoretic notion of the semirecursive sets and the extant complexity-theoretic notion of P-selectivity. Our hierarchy-collapse result follows by combining the easy observation that every set in NP is NPMV-selective with the following result: If A ∈ NP is NPSV-selective, then A ∈ (NP∩coNP)/poly. Relatedly, we prove that if A ∈ NP is NPSV-selective, then A is Low2. We prove that the polynomial hierarchy collapses even further, namely to NP, if all coNP sets are NPMV-selective. This follows from a more general result we prove: Every self-reducible NPMV-selective set is in NP.

Original languageEnglish (US)
Pages (from-to)697-708
Number of pages12
JournalSIAM Journal on Computing
Volume25
Issue number4
StatePublished - Aug 1996
Externally publishedYes

Fingerprint

Polynomial Hierarchy
Polynomials
Computing
Assignment
Partial
Output
Selectivity
Recursion
Refinement
Likely
Analogue

Keywords

  • Computational complexity
  • Lowness
  • Nonuniform complexity
  • Semidecision algorithms

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Theoretical Computer Science

Cite this

Hemaspaandra, L. A., Naik, A. V., Ogihara, M., & Selman, A. L. (1996). Computing solutions uniquely collapses the polynomial hierarchy. SIAM Journal on Computing, 25(4), 697-708.

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

In: SIAM Journal on Computing, Vol. 25, No. 4, 08.1996, p. 697-708.

Research output: Contribution to journalArticle

Hemaspaandra, LA, Naik, AV, Ogihara, M & Selman, AL 1996, 'Computing solutions uniquely collapses the polynomial hierarchy', SIAM Journal on Computing, vol. 25, no. 4, pp. 697-708.
Hemaspaandra, Lane A. ; Naik, Ashish V. ; Ogihara, Mitsunori ; Selman, Alan L. / Computing solutions uniquely collapses the polynomial hierarchy. In: SIAM Journal on Computing. 1996 ; Vol. 25, No. 4. pp. 697-708.
@article{161ec885b92f423ea0ad485e53d66372,
title = "Computing solutions uniquely collapses the polynomial hierarchy",
abstract = "Is there an NP function that, when given a satisfiable formula as input, outputs one satisfying assignment uniquely? That is, can a nondeterministic function cull just one satisfying assignment from a possibly exponentially large collection of assignments? We show that if there is such a nondeterministic function, then the polynomial hierarchy collapses to ZPPNP (and thus, in particular, to NPNP). Because 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. We prove our result via a result of independent interest. We say that a set A is NPSV-selective (NPMV-selective) if there is a 2-ary partial NP function with unique values (a 2-ary partial NP function) that decides which of its inputs (if any) is {"}more likely{"} to belong to A; this is a nondeterministic analog of the recursion-theoretic notion of the semirecursive sets and the extant complexity-theoretic notion of P-selectivity. Our hierarchy-collapse result follows by combining the easy observation that every set in NP is NPMV-selective with the following result: If A ∈ NP is NPSV-selective, then A ∈ (NP∩coNP)/poly. Relatedly, we prove that if A ∈ NP is NPSV-selective, then A is Low2. We prove that the polynomial hierarchy collapses even further, namely to NP, if all coNP sets are NPMV-selective. This follows from a more general result we prove: Every self-reducible NPMV-selective set is in NP.",
keywords = "Computational complexity, Lowness, Nonuniform complexity, Semidecision algorithms",
author = "Hemaspaandra, {Lane A.} and Naik, {Ashish V.} and Mitsunori Ogihara and Selman, {Alan L.}",
year = "1996",
month = "8",
language = "English (US)",
volume = "25",
pages = "697--708",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "4",

}

TY - JOUR

T1 - Computing solutions uniquely collapses the polynomial hierarchy

AU - Hemaspaandra, Lane A.

AU - Naik, Ashish V.

AU - Ogihara, Mitsunori

AU - Selman, Alan L.

PY - 1996/8

Y1 - 1996/8

N2 - Is there an NP function that, when given a satisfiable formula as input, outputs one satisfying assignment uniquely? That is, can a nondeterministic function cull just one satisfying assignment from a possibly exponentially large collection of assignments? We show that if there is such a nondeterministic function, then the polynomial hierarchy collapses to ZPPNP (and thus, in particular, to NPNP). Because 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. We prove our result via a result of independent interest. We say that a set A is NPSV-selective (NPMV-selective) if there is a 2-ary partial NP function with unique values (a 2-ary partial NP function) that decides which of its inputs (if any) is "more likely" to belong to A; this is a nondeterministic analog of the recursion-theoretic notion of the semirecursive sets and the extant complexity-theoretic notion of P-selectivity. Our hierarchy-collapse result follows by combining the easy observation that every set in NP is NPMV-selective with the following result: If A ∈ NP is NPSV-selective, then A ∈ (NP∩coNP)/poly. Relatedly, we prove that if A ∈ NP is NPSV-selective, then A is Low2. We prove that the polynomial hierarchy collapses even further, namely to NP, if all coNP sets are NPMV-selective. This follows from a more general result we prove: Every self-reducible NPMV-selective set is in NP.

AB - Is there an NP function that, when given a satisfiable formula as input, outputs one satisfying assignment uniquely? That is, can a nondeterministic function cull just one satisfying assignment from a possibly exponentially large collection of assignments? We show that if there is such a nondeterministic function, then the polynomial hierarchy collapses to ZPPNP (and thus, in particular, to NPNP). Because 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. We prove our result via a result of independent interest. We say that a set A is NPSV-selective (NPMV-selective) if there is a 2-ary partial NP function with unique values (a 2-ary partial NP function) that decides which of its inputs (if any) is "more likely" to belong to A; this is a nondeterministic analog of the recursion-theoretic notion of the semirecursive sets and the extant complexity-theoretic notion of P-selectivity. Our hierarchy-collapse result follows by combining the easy observation that every set in NP is NPMV-selective with the following result: If A ∈ NP is NPSV-selective, then A ∈ (NP∩coNP)/poly. Relatedly, we prove that if A ∈ NP is NPSV-selective, then A is Low2. We prove that the polynomial hierarchy collapses even further, namely to NP, if all coNP sets are NPMV-selective. This follows from a more general result we prove: Every self-reducible NPMV-selective set is in NP.

KW - Computational complexity

KW - Lowness

KW - Nonuniform complexity

KW - Semidecision algorithms

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

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

M3 - Article

AN - SCOPUS:0001703687

VL - 25

SP - 697

EP - 708

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 4

ER -