Information and Computation
Journal of Computer and System Sciences
A Uniform Circuit Lower Bound For the Permanent
SIAM Journal on Computing
Separating classes in the exponential-time hierarchy from classes in PH
Theoretical Computer Science
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Separating Nondeterministic Time Complexity Classes
Journal of the ACM (JACM)
Two oracles that force a big crunch
Computational Complexity
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
SIAM Journal on Computing
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
Nonuniform Lower Bounds for Exponential Time Classes
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A hierarchy for nondeterministic time complexity
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Pseudorandomness and Average-Case Complexity via Uniform Reductions
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Hierarchy Theorems for Probabilistic Polynomial Time
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Hierarchies for semantic classes
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Time-space lower bounds for satisfiability
Journal of the ACM (JACM)
A Generic Time Hierarchy for Semantic Models with One Bit of Advice
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
Robust simulations and significant separations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
NE is not NP turing reducible to nonexponentially dense NP sets
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Hi-index | 0.00 |
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including: 1 For any constant c , ${\sf NEXP} \not \subseteq {\rm{\sf P}}^{\sf NP[n^c]}/n^c$ 1 For any constant c , ${\sf MAEXP} \not \subseteq {\rm {\sf MA}}/n^c$ 1 ${\sf BPEXP} \not \subseteq {\sf BPP}/n^{o(1)}$ It was previously unknown even whether NEXP *** NP/n 0.01. For the probabilistic classes, no lower bounds for uniform exponential time against advice were known before. We also consider the question of whether these lower bounds can be made to work on almost all input lengths rather than on infinitely many. We give an oracle relative to which NEXP *** io NP, which provides evidence that this is not possible with current techniques.