Randomness conservation inequalities; information and independence in mathematical theories
Information and Control
Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
SIAM Journal on Computing
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Some consequences of the existence of pseudorandom generators
Journal of Computer and System Sciences
Kolmogorov complexity and degrees of tally sets
Information and Computation
On the complexity of learning minimum time-bounded Turing machines
SIAM Journal on Computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Almost everywhere high nonuniform complexity
Journal of Computer and System Sciences
Journal of Computer and System Sciences
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
An excursion to the Kolmogorov random strings
Journal of Computer and System Sciences - special issue on complexity theory
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Large sets in AC0 have many strings with low Kolmogorov complexity
Information Processing Letters
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
Construction of extractors using pseudo-random generators (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On pseudorandomness and resource-bounded measure
Theoretical Computer Science
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
SIAM Journal on Computing
Resource-Bounded Kolmogorov Complexity Revisited
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
The First-Order Isomorphism Theorem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Hard Sets and Pseudo-random Generators for Constant Depth Circuits
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Pseudorandom generators, measure theory, and natural proofs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Derandomizing Arthur-Merlin Games Using Hitting Sets
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Near-Optimal Conversion of Hardness into Pseudo-Randomness
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Comparing Notions of Full Derandomization
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Generalized Kolmogorov complexity and the structure of feasible computations
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Decision versus search problems in super-polynomial time
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Dimension, entropy rates, and compression
Journal of Computer and System Sciences
Avoiding simplicity is complex
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Dimension characterizations of complexity classes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hardness hypotheses, derandomization, and circuit complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Natural proofs versus derandomization
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
This paper has the following goals: - To survey some of the recent developments in the field of derandomization. - To introduce a new notion of time-bounded Kolmogorov complexity (KT), and show that it provides a useful tool for understanding advances in derandomization, and for putting various results in context. - To illustrate the usefulness of KT, by answering a question that has been posed in the literature, and - To pose some promising directions for future research.