Information and Computation
Structural complexity 1
Structural complexity 2
Almost-everywhere complexity hierarchies for nondeterministic time
Theoretical Computer Science
On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
On Relativization and the Existence of Complete Sets
Proceedings of the 9th Colloquium on Automata, Languages and Programming
A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
A hierarchy for nondeterministic time complexity
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Hierarchy Theorems for Probabilistic Polynomial Time
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
SIGACT news complexity theory column 52
ACM SIGACT News
A Generic Time Hierarchy with One Bit of Advice
Computational Complexity
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
A (de)constructive approach to program checking
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Unconditional Lower Bounds against Advice
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Different approaches to proof systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Time hierarchies for sampling distributions
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
We show that for any constant a, ZPP/b(n) strictly contains ZPTIME(na)/b(n) for some b(n) = O(log n log log n). Our techniques are very general and give the same hierarchy for all common semantic time classes including RTIME, NTIME ∩ coNTIME, UTIME, MATIME, AMTIME and BQTIME.We show a stronger hierarchy for RTIME: For every constant c, RP/1 is not contained in RTIME(nc)/(log n)1/2c. To prove this result we first prove a similar statement for NP by building on Zák's proof of the nondeterministic time hierarchy.