The PL Hierarchy Collapses

Authors:
Mitsunori Ogihara
Affiliations:
-
Venue:
SIAM Journal on Computing
Year:
1998

Citing 0
Cited 4

The Complexity of Membership Problems for Circuits over Sets of Natural Numbers

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of the Inertia

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Counting classes and the fine structure between NC1and L

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Counting classes and the fine structure between NC1 and L

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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