Robust Simulations and Significant Separations
- 1.2k Downloads
We define and study a new notion of “robust simulations” between complexity classes which is intermediate between the traditional notions of infinitely-often and almost-everywhere, as well as a corresponding notion of “significant separations”. A language L has a robust simulation in a complexity class C if there is a language in C which agrees with L on arbitrarily large polynomial stretches of input lengths. There is a significant separation of L from C if there is no robust simulation of L ∈ C.
The new notion of simulation is a cleaner and more natural notion of simulation than the infinitely-often notion. We show that various implications in complexity theory such as the collapse of PH if NP = P and the Karp-Lipton theorem have analogues for robust simulations. We then use these results to prove that most known separations in complexity theory, such as hierarchy theorems, fixed polynomial circuit lower bounds, time-space tradeoffs, and the recent theorem of Williams, can be strengthened to significant separations, though in each case, an almost everywhere separation is unknown.
Proving our results requires several new ideas, including a completely different proof of the hierarchy theorem for non-deterministic polynomial time than the ones previously known.
KeywordsTuring Machine Complexity Class Input Length Promise Problem Nondeterministic Turing Machine
Unable to display preview. Download preview PDF.
- [BFT98]Buhrman, H., Fortnow, L., Thierauf, T.: Nonrelativizing separations. In: Proceedings of 13th Annual IEEE Conference on Computational Complexity, pp. 8–12 (1998)Google Scholar
- [Cai01]Cai, J.-Y.: S2 P ⊆ ZPPNP. In: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, pp. 620–629 (2001)Google Scholar
- [Coo72]Cook, S.: A hierarchy for nondeterministic time complexity. In: Fourth Annual ACM Symposium on Theory of Computing, Conference Record, Denver, Colorado, May 1-3, pp. 187–192 (1972)Google Scholar
- [FS04]Fortnow, L., Santhanam, R.: Hierarchy theorems for probabilistic polynomial time. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pp. 316–324 (2004)Google Scholar
- [Hås86]Håstad, J.: Almost optimal lower bounds for small depth circuits. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp. 6–20 (1986)Google Scholar
- [IW97]Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pp. 220–229 (1997)Google Scholar
- [KvM99]Klivans, A., van Melkebeek, D.: Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 659–667 (1999)Google Scholar
- [San07]Santhanam, R.: Circuit lower bounds for Merlin-Arthur classes. In: Proceedings of 39th Annual Symposium on Theory of Computing, pp. 275–283 (2007)Google Scholar
- [vMP06]van Melkebeek, D., Pervyshev, K.: A generic time hierarchy for semantic models with one bit of advice. In: Proceedings of 21st Annual IEEE Conference on Computational Complexity, pp. 129–144 (2006)Google Scholar
- [Wil10a]Williams, R.: Improving exhaustive search implies superpolynomial lower bounds. In: Proceedings of the 42nd Annual ACM Symposium on Theory of Computing, pp. 231–240 (2010)Google Scholar
- [Wil10b]Williams, R.: Non-uniform ACC circuit lower bounds (2010) (manuscript)Google Scholar