The PL hierarchy collapses

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

It is shown that the PL hierarchy PLH = PL ∪ PLPL ∪ PLPLPL ∪ ..., defined in terms of the Ruzzo-Simon-Tompa relativization, collapses to PL.

Original languageEnglish (US)
Pages (from-to)1430-1437
Number of pages8
JournalSIAM Journal on Computing
Volume27
Issue number5
StatePublished - 1998
Externally publishedYes

Fingerprint

Relativization
Hierarchy

Keywords

  • Constant-depth circuits
  • Logspace reducibility
  • Nondeterministic complexity classes
  • Probabilistic complexity classes
  • Relativization

ASJC Scopus subject areas

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

Cite this

The PL hierarchy collapses. / Ogihara, Mitsunori.

In: SIAM Journal on Computing, Vol. 27, No. 5, 1998, p. 1430-1437.

Research output: Contribution to journalArticle

Ogihara, M 1998, 'The PL hierarchy collapses', SIAM Journal on Computing, vol. 27, no. 5, pp. 1430-1437.
Ogihara, Mitsunori. / The PL hierarchy collapses. In: SIAM Journal on Computing. 1998 ; Vol. 27, No. 5. pp. 1430-1437.
@article{055ecc68eb124ddd8a5bab5460b149b4,
title = "The PL hierarchy collapses",
abstract = "It is shown that the PL hierarchy PLH = PL ∪ PLPL ∪ PLPLPL ∪ ..., defined in terms of the Ruzzo-Simon-Tompa relativization, collapses to PL.",
keywords = "Constant-depth circuits, Logspace reducibility, Nondeterministic complexity classes, Probabilistic complexity classes, Relativization",
author = "Mitsunori Ogihara",
year = "1998",
language = "English (US)",
volume = "27",
pages = "1430--1437",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "5",

}

TY - JOUR

T1 - The PL hierarchy collapses

AU - Ogihara, Mitsunori

PY - 1998

Y1 - 1998

N2 - It is shown that the PL hierarchy PLH = PL ∪ PLPL ∪ PLPLPL ∪ ..., defined in terms of the Ruzzo-Simon-Tompa relativization, collapses to PL.

AB - It is shown that the PL hierarchy PLH = PL ∪ PLPL ∪ PLPLPL ∪ ..., defined in terms of the Ruzzo-Simon-Tompa relativization, collapses to PL.

KW - Constant-depth circuits

KW - Logspace reducibility

KW - Nondeterministic complexity classes

KW - Probabilistic complexity classes

KW - Relativization

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

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

M3 - Article

AN - SCOPUS:0039469908

VL - 27

SP - 1430

EP - 1437

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 5

ER -