A Note on the Karp-Lipton Collapse for the Exponential Hierarchy

Authors

Chris Bourke, University of Nebraska-LincolnFollow

Date of this Version

2007

Comments

Published in University of Nebraska–Lincoln, Computer Science and Engineering Technical Report TR-UNL-CSE-2007-004.

Abstract

We extend previous collapsing results involving the exponential hierarchy by using recent hardness-randomness trade-off results. Specifically, we show that if the second level of the exponential hierarchy has polynomial-sized circuits, then it collapses all the way down to MA.