Title :
Relativized polynomial time hierarchies having exactly K levels
Author_Institution :
Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
Abstract :
Summary form only given. The relativization of the Meyer-Stockmeyer polynomial-time hierarchy is treated. The proof techniques combine an encoding scheme with probabilistic arguments
Keywords :
computational complexity; K levels; Meyer-Stockmeyer polynomial-time hierarchy; encoding scheme; probabilistic arguments; relativization; Circuits; Computer science; Encoding; Interference; Polynomials;
Conference_Titel :
Structure in Complexity Theory Conference, 1988. Proceedings., Third Annual
Conference_Location :
Washington, DC
Print_ISBN :
0-8186-0866-8
DOI :
10.1109/SCT.1988.5284
