The PL hierarchy collapses

SIAM Journal on Computing

Volumn 27, Issue 5, 1998, Pages 1430-1437

  Ogihara, Mitsunori ^a  

^a University of Rochester   (United States)

Author keywords

Constant depth circuits; Logspace reducibility; Nondeterministic complexity classes; Probabilistic complexity classes; Relativization

Indexed keywords

EID: 0039469908     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795295924     Document Type: Article

References (4)

1. E. ALLENDER AND M. OGIHARA, Relationships among PL, #L, and the determinant, in Proc. 9th IEEE Conf. on Structure in Complex. Theory, 1994, pp. 267-278.
2. T. BAKER, J. GILL, AND R. SOLOVAY, Relativizations of the P =?NP question, SIAM J. Comput., 4 (1975), pp. 431-442.
3. 1, J. Comput. System Sci., 38 (1989), pp. 150-164.
4. R. BEIGEL AND B. Fu, Circuits over PP and PL, in Proc. 12th Conf. on Comput. Complexity, IEEE Computer Society Press, Los Alamitos, CA, 1997, pp. 24-35.