Some Results on Derandomization
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Theoretical Computer Science
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
SIGACT news complexity theory column 48
ACM SIGACT News
Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword
Computational Complexity
Hardness amplification proofs require majority
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Limitations of Hardness vs. Randomness under Uniform Reductions
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Efficient learning algorithms yield circuit lower bounds
Journal of Computer and System Sciences
Pseudorandom Generators and Typically-Correct Derandomization
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Typically-correct derandomization
ACM SIGACT News
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
A zero-one SUBEXP-dimension law for BPP
Information Processing Letters
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
Repeated matching pennies with limited randomness
Proceedings of the 12th ACM conference on Electronic commerce
Limits on the computational power of random strings
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Studies in complexity and cryptography
Efficient learning algorithms yield circuit lower bounds
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Limits on the computational power of random strings
Information and Computation
Natural proofs versus derandomization
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Unions of Disjoint NP-Complete Sets
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |