Competing provers yield improved Karp-Lipton collapse results

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

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Via competing provers, we show that if a language A is self-reducible and has polynomial-size circuits then S2 A = 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 S2 NP. Under the same assumptions, the best previously known collapses were to ZPPNP and ZPPNPNP respectively ([20,6], building on [18,1,17,30]). It is known that S2 ⊆ ZPPNP [8]. That result and its relativized version show that our new collapses indeed improve the previously known results. Since 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 - our results implicitly strengthen all those results.

Original languageEnglish (US)
Pages (from-to)535-546
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2607
StatePublished - 2003
Externally publishedYes

Fingerprint

Language
Polynomials
Polynomial Hierarchy
Theorem
Networks (circuits)
Unique Solution
Polynomial
Approximation

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

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

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2607, 2003, p. 535-546.

Research output: Contribution to journalArticle

@article{affd289b34894f78bbd98d6d3cbfceac,
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 S2 A = 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 S2 NP. Under the same assumptions, the best previously known collapses were to ZPPNP and ZPPNPNP respectively ([20,6], building on [18,1,17,30]). It is known that S2 ⊆ ZPPNP [8]. That result and its relativized version show that our new collapses indeed improve the previously known results. Since 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 - our results implicitly strengthen all those results.",
author = "Cai, {Jin Yi} and Chakaravarthy, {Venkatesan T.} and Hemaspaandra, {Lane A.} and Mitsunori Ogihara",
year = "2003",
language = "English (US)",
volume = "2607",
pages = "535--546",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

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 - 2003

Y1 - 2003

N2 - Via competing provers, we show that if a language A is self-reducible and has polynomial-size circuits then S2 A = 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 S2 NP. Under the same assumptions, the best previously known collapses were to ZPPNP and ZPPNPNP respectively ([20,6], building on [18,1,17,30]). It is known that S2 ⊆ ZPPNP [8]. That result and its relativized version show that our new collapses indeed improve the previously known results. Since 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 - our results implicitly strengthen all those results.

AB - Via competing provers, we show that if a language A is self-reducible and has polynomial-size circuits then S2 A = 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 S2 NP. Under the same assumptions, the best previously known collapses were to ZPPNP and ZPPNPNP respectively ([20,6], building on [18,1,17,30]). It is known that S2 ⊆ ZPPNP [8]. That result and its relativized version show that our new collapses indeed improve the previously known results. Since 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 - our results implicitly strengthen all those results.

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

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

M3 - Article

AN - SCOPUS:35248819735

VL - 2607

SP - 535

EP - 546

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -