Competing provers yield improved Karp-Lipton collapse results

Jin Yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

Via competing provers, we show that if a language A is self-reducible and has polynomial-size circuits then S2A=S2. Building on this, we strengthen the Kämper-AFK theorem, namely, we prove that if NP ⊆ (NP ∩ coNP)/poly then the polynomial hierarchy collapses to S2NP∩coNP. We also strengthen Yap's theorem, namely, we prove that if NP ⊆ coNP/poly then the polynomial hierarchy collapses to S2NP. Under the same assumptions, the best previously known collapses were to ZPPNP and ZPPNPNP, respectively ([SIAM Journal on Computing 28 (1) (1998) 311; Journal of Computer and System Sciences 52 (3) (1996) 421], building on [Proceedings of the 12th ACM Symposium on Theory of Computing, ACM Press, New York, 1980, pp. 302-309; Journal of Computer and System Sciences 39 (1989) 21; Theoretical Computer Science 85 (2) (1991) 305; Theoretical Computer Science 26 (3) (1983) 287]). It is known that S2 ⊆ ZPPNP [Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 620-629]. That result and its relativized version show that our new collapses indeed improve the previously known results. The Kämper-AFK theorem and Yap's theorem are used in the literature as bridges in a variety of results-ranging from the study of unique solutions to issues of approximation-and so our results implicitly strengthen those results.

Original languageEnglish (US)
Pages (from-to)1-23
Number of pages23
JournalInformation and Computation
Volume198
Issue number1
DOIs
StatePublished - Apr 10 2005
Externally publishedYes

Fingerprint

Computer science
Polynomial Hierarchy
Computer Science
Systems science
Polynomials
Theorem
Computing
Silver
Unique Solution
Polynomial
Networks (circuits)
Approximation

Keywords

  • Competing provers
  • Kämper-AFK theorem
  • Karp-Lipton theorem
  • Lowness
  • Nonuniform complexity
  • Structural complexity
  • Symmetric alternation
  • Yap's theorem

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Competing provers yield improved Karp-Lipton collapse results. / Cai, Jin Yi; Chakaravarthy, Venkatesan T.; Hemaspaandra, Lane A.; Ogihara, Mitsunori.

In: Information and Computation, Vol. 198, No. 1, 10.04.2005, p. 1-23.

Research output: Contribution to journalArticle

Cai, Jin Yi ; Chakaravarthy, Venkatesan T. ; Hemaspaandra, Lane A. ; Ogihara, Mitsunori. / Competing provers yield improved Karp-Lipton collapse results. In: Information and Computation. 2005 ; Vol. 198, No. 1. pp. 1-23.
@article{d35c8a69d05a45db9ccd17242089c857,
title = "Competing provers yield improved Karp-Lipton collapse results",
abstract = "Via competing provers, we show that if a language A is self-reducible and has polynomial-size circuits then S2A=S2. Building on this, we strengthen the K{\"a}mper-AFK theorem, namely, we prove that if NP ⊆ (NP ∩ coNP)/poly then the polynomial hierarchy collapses to S2NP∩coNP. We also strengthen Yap's theorem, namely, we prove that if NP ⊆ coNP/poly then the polynomial hierarchy collapses to S2NP. Under the same assumptions, the best previously known collapses were to ZPPNP and ZPPNPNP, respectively ([SIAM Journal on Computing 28 (1) (1998) 311; Journal of Computer and System Sciences 52 (3) (1996) 421], building on [Proceedings of the 12th ACM Symposium on Theory of Computing, ACM Press, New York, 1980, pp. 302-309; Journal of Computer and System Sciences 39 (1989) 21; Theoretical Computer Science 85 (2) (1991) 305; Theoretical Computer Science 26 (3) (1983) 287]). It is known that S2 ⊆ ZPPNP [Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 620-629]. That result and its relativized version show that our new collapses indeed improve the previously known results. The K{\"a}mper-AFK theorem and Yap's theorem are used in the literature as bridges in a variety of results-ranging from the study of unique solutions to issues of approximation-and so our results implicitly strengthen those results.",
keywords = "Competing provers, K{\"a}mper-AFK theorem, Karp-Lipton theorem, Lowness, Nonuniform complexity, Structural complexity, Symmetric alternation, Yap's theorem",
author = "Cai, {Jin Yi} and Chakaravarthy, {Venkatesan T.} and Hemaspaandra, {Lane A.} and Mitsunori Ogihara",
year = "2005",
month = "4",
day = "10",
doi = "10.1016/j.ic.2005.01.002",
language = "English (US)",
volume = "198",
pages = "1--23",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",
number = "1",

}

TY - JOUR

T1 - Competing provers yield improved Karp-Lipton collapse results

AU - Cai, Jin Yi

AU - Chakaravarthy, Venkatesan T.

AU - Hemaspaandra, Lane A.

AU - Ogihara, Mitsunori

PY - 2005/4/10

Y1 - 2005/4/10

N2 - Via competing provers, we show that if a language A is self-reducible and has polynomial-size circuits then S2A=S2. Building on this, we strengthen the Kämper-AFK theorem, namely, we prove that if NP ⊆ (NP ∩ coNP)/poly then the polynomial hierarchy collapses to S2NP∩coNP. We also strengthen Yap's theorem, namely, we prove that if NP ⊆ coNP/poly then the polynomial hierarchy collapses to S2NP. Under the same assumptions, the best previously known collapses were to ZPPNP and ZPPNPNP, respectively ([SIAM Journal on Computing 28 (1) (1998) 311; Journal of Computer and System Sciences 52 (3) (1996) 421], building on [Proceedings of the 12th ACM Symposium on Theory of Computing, ACM Press, New York, 1980, pp. 302-309; Journal of Computer and System Sciences 39 (1989) 21; Theoretical Computer Science 85 (2) (1991) 305; Theoretical Computer Science 26 (3) (1983) 287]). It is known that S2 ⊆ ZPPNP [Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 620-629]. That result and its relativized version show that our new collapses indeed improve the previously known results. The Kämper-AFK theorem and Yap's theorem are used in the literature as bridges in a variety of results-ranging from the study of unique solutions to issues of approximation-and so our results implicitly strengthen those results.

AB - Via competing provers, we show that if a language A is self-reducible and has polynomial-size circuits then S2A=S2. Building on this, we strengthen the Kämper-AFK theorem, namely, we prove that if NP ⊆ (NP ∩ coNP)/poly then the polynomial hierarchy collapses to S2NP∩coNP. We also strengthen Yap's theorem, namely, we prove that if NP ⊆ coNP/poly then the polynomial hierarchy collapses to S2NP. Under the same assumptions, the best previously known collapses were to ZPPNP and ZPPNPNP, respectively ([SIAM Journal on Computing 28 (1) (1998) 311; Journal of Computer and System Sciences 52 (3) (1996) 421], building on [Proceedings of the 12th ACM Symposium on Theory of Computing, ACM Press, New York, 1980, pp. 302-309; Journal of Computer and System Sciences 39 (1989) 21; Theoretical Computer Science 85 (2) (1991) 305; Theoretical Computer Science 26 (3) (1983) 287]). It is known that S2 ⊆ ZPPNP [Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 620-629]. That result and its relativized version show that our new collapses indeed improve the previously known results. The Kämper-AFK theorem and Yap's theorem are used in the literature as bridges in a variety of results-ranging from the study of unique solutions to issues of approximation-and so our results implicitly strengthen those results.

KW - Competing provers

KW - Kämper-AFK theorem

KW - Karp-Lipton theorem

KW - Lowness

KW - Nonuniform complexity

KW - Structural complexity

KW - Symmetric alternation

KW - Yap's theorem

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

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

U2 - 10.1016/j.ic.2005.01.002

DO - 10.1016/j.ic.2005.01.002

M3 - Article

AN - SCOPUS:15844376276

VL - 198

SP - 1

EP - 23

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

IS - 1

ER -