A relationship between difference hierarchies and relativized polynomial hierarchies

Richard Beigel, Richard Chang, Mitsunori Ogihara

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

Chang and Kadin have shown that if the difference hierarchy over NP collapses to level k, then the polynomial hierarchy (PH) is equal to the kth level of the difference hierarchy over Σ2p. We simplify their poof and obtain a slightly stronger conclusion: if the difference hierarchy over NP collapses to level k, then PH collapses to (P(k-1)NP)NP, the class of sets recognized in polynomial time with k - 1 nonadaptive queries to a set in NPNP and an unlimited number of queries to a set in NP. We also extend the result to classes other than NP: For any class C that has ≤mp-complete sets and is closed under ≤conjp-and ≤mNP-reductions (alternatively, closed under ≤disjp-and ≤mco-NP-reductions), if the difference hierarchy over C collapses to level k, then PHC = (P(k-1)-ttNP)C. Then we show that the exact counting class C_P is closed under ≤disjp- and ≤mco-NP-reductions. Consequently, if the difference hierarchy over C_P collapses to level k, then PHPP(= PHC_P) is equal to (P(k-1)-ttNP)PP. In contrast, the difference hierarchy over the closely related class PP is known to collapse. Finally we consider two ways of relativizing the bounded query class Pk-ttNP: the restricted relativization Pk-ttNPC and the full relativization (Pk-ttNP)C. If C is NP-hard, then we show that the two relativizations are different unless PHC collapses.

Original languageEnglish (US)
Pages (from-to)293-310
Number of pages18
JournalMathematical Systems Theory
Volume26
Issue number3
DOIs
StatePublished - Jul 1993
Externally publishedYes

Fingerprint

Polynomial Hierarchy
Polynomials
Relativization
Query
Closed
Relationships
Hierarchy
Class
Counting
Polynomial time
Simplify
NP-complete problem

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Mathematics(all)
  • Computational Theory and Mathematics

Cite this

A relationship between difference hierarchies and relativized polynomial hierarchies. / Beigel, Richard; Chang, Richard; Ogihara, Mitsunori.

In: Mathematical Systems Theory, Vol. 26, No. 3, 07.1993, p. 293-310.

Research output: Contribution to journalArticle

@article{8d32909473ee41fc9769dfb557075e28,
title = "A relationship between difference hierarchies and relativized polynomial hierarchies",
abstract = "Chang and Kadin have shown that if the difference hierarchy over NP collapses to level k, then the polynomial hierarchy (PH) is equal to the kth level of the difference hierarchy over Σ2p. We simplify their poof and obtain a slightly stronger conclusion: if the difference hierarchy over NP collapses to level k, then PH collapses to (P(k-1)NP)NP, the class of sets recognized in polynomial time with k - 1 nonadaptive queries to a set in NPNP and an unlimited number of queries to a set in NP. We also extend the result to classes other than NP: For any class C that has ≤mp-complete sets and is closed under ≤conjp-and ≤mNP-reductions (alternatively, closed under ≤disjp-and ≤mco-NP-reductions), if the difference hierarchy over C collapses to level k, then PHC = (P(k-1)-ttNP)C. Then we show that the exact counting class C_P is closed under ≤disjp- and ≤mco-NP-reductions. Consequently, if the difference hierarchy over C_P collapses to level k, then PHPP(= PHC_P) is equal to (P(k-1)-ttNP)PP. In contrast, the difference hierarchy over the closely related class PP is known to collapse. Finally we consider two ways of relativizing the bounded query class Pk-ttNP: the restricted relativization Pk-ttNPC and the full relativization (Pk-ttNP)C. If C is NP-hard, then we show that the two relativizations are different unless PHC collapses.",
author = "Richard Beigel and Richard Chang and Mitsunori Ogihara",
year = "1993",
month = "7",
doi = "10.1007/BF01371729",
language = "English (US)",
volume = "26",
pages = "293--310",
journal = "Theory of Computing Systems",
issn = "1432-4350",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - A relationship between difference hierarchies and relativized polynomial hierarchies

AU - Beigel, Richard

AU - Chang, Richard

AU - Ogihara, Mitsunori

PY - 1993/7

Y1 - 1993/7

N2 - Chang and Kadin have shown that if the difference hierarchy over NP collapses to level k, then the polynomial hierarchy (PH) is equal to the kth level of the difference hierarchy over Σ2p. We simplify their poof and obtain a slightly stronger conclusion: if the difference hierarchy over NP collapses to level k, then PH collapses to (P(k-1)NP)NP, the class of sets recognized in polynomial time with k - 1 nonadaptive queries to a set in NPNP and an unlimited number of queries to a set in NP. We also extend the result to classes other than NP: For any class C that has ≤mp-complete sets and is closed under ≤conjp-and ≤mNP-reductions (alternatively, closed under ≤disjp-and ≤mco-NP-reductions), if the difference hierarchy over C collapses to level k, then PHC = (P(k-1)-ttNP)C. Then we show that the exact counting class C_P is closed under ≤disjp- and ≤mco-NP-reductions. Consequently, if the difference hierarchy over C_P collapses to level k, then PHPP(= PHC_P) is equal to (P(k-1)-ttNP)PP. In contrast, the difference hierarchy over the closely related class PP is known to collapse. Finally we consider two ways of relativizing the bounded query class Pk-ttNP: the restricted relativization Pk-ttNPC and the full relativization (Pk-ttNP)C. If C is NP-hard, then we show that the two relativizations are different unless PHC collapses.

AB - Chang and Kadin have shown that if the difference hierarchy over NP collapses to level k, then the polynomial hierarchy (PH) is equal to the kth level of the difference hierarchy over Σ2p. We simplify their poof and obtain a slightly stronger conclusion: if the difference hierarchy over NP collapses to level k, then PH collapses to (P(k-1)NP)NP, the class of sets recognized in polynomial time with k - 1 nonadaptive queries to a set in NPNP and an unlimited number of queries to a set in NP. We also extend the result to classes other than NP: For any class C that has ≤mp-complete sets and is closed under ≤conjp-and ≤mNP-reductions (alternatively, closed under ≤disjp-and ≤mco-NP-reductions), if the difference hierarchy over C collapses to level k, then PHC = (P(k-1)-ttNP)C. Then we show that the exact counting class C_P is closed under ≤disjp- and ≤mco-NP-reductions. Consequently, if the difference hierarchy over C_P collapses to level k, then PHPP(= PHC_P) is equal to (P(k-1)-ttNP)PP. In contrast, the difference hierarchy over the closely related class PP is known to collapse. Finally we consider two ways of relativizing the bounded query class Pk-ttNP: the restricted relativization Pk-ttNPC and the full relativization (Pk-ttNP)C. If C is NP-hard, then we show that the two relativizations are different unless PHC collapses.

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

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

U2 - 10.1007/BF01371729

DO - 10.1007/BF01371729

M3 - Article

AN - SCOPUS:0001656946

VL - 26

SP - 293

EP - 310

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 3

ER -