Title :
Nonrelativizing separations
Author :
Buhrman, Harry ; Fortnow, L. ; Thierauf, Thomas
Author_Institution :
CWI, Amsterdam, Netherlands
Abstract :
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to Kannan since we furthermore show that our result does not relativize. This is the first separation result in complexity theory that does not relativize. As a corollary to our separation result we also obtain that PEXP, the exponential time version of PP is nor in P/poly
Keywords :
computational complexity; Merlin-Arthur class; complexity theory; exponential time version; nonrelativizing separations; Circuits; Complexity theory; Computer science; Electrical capacitance tomography; Legged locomotion; Polynomials; Uniform resource locators; World Wide Web;
Conference_Titel :
Computational Complexity, 1998. Proceedings. Thirteenth Annual IEEE Conference on
Conference_Location :
Buffalo, NY
Print_ISBN :
0-8186-8395-3
DOI :
10.1109/CCC.1998.694585