A Note on the Karp-Lipton Collapse for the Exponential Hierarchy
Chris Bourke · Lincoln (University of Nebraska) · 2007
We extend previous collapsing results involving the exponential hierar-chy 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.