Computing, School of
School of Computing: Technical Reports
Accessibility Remediation
If you are unable to use this item in its current form due to accessibility barriers, you may request remediation through our remediation request form.
Date of this Version
2007
Document Type
Article
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.
Comments
Published in University of Nebraska–Lincoln, Computer Science and Engineering Technical Report TR-UNL-CSE-2007-004.