A downward collapse within the polynomial hierarchy

SIAM Journal on Computing

Volumn 28, Issue 2, 1998, Pages 383-393

  Hemaspaandra, Edith ^a  

^a LE MOYNE COLLEGE   (United States)

Author keywords

Computational complexity theory; Downward collapse; Easy hard arguments; Polynomial hierarchy

Indexed keywords

POLYNOMIALS; THEOREM PROVING;

DOWNWARD COLLAPSE; POLYNOMIAL HIERARCHY;

COMPUTATIONAL COMPLEXITY;

EID: 0032108004     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796306474     Document Type: Article

References (1)

1. [A1186] E. ALLENDER, The complexity of sparse sets in P, in Proc. 1st Structure in Complexity Theory Conference, Lecture Notes in Computer Science 223, Springer-Verlag, Berlin, 1986, pp. 1-11.