Comparing Notions of Full Derandomization

Authors:
Lance Fortnow
Affiliations:
-
Venue:
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Year:
2001

Citing 0
Cited 8

In search of an easy witness: exponential time vs. probabilistic polynomial time

Journal of Computer and System Sciences - Complexity 2001
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Pseudorandomness and Average-Case Complexity Via Uniform Reductions

Computational Complexity
Improving exhaustive search implies superpolynomial lower bounds

Proceedings of the forty-second ACM symposium on Theory of computing
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory

Journal of Computer and System Sciences
In a world of P=BPP

Studies in complexity and cryptography
Computational complexity since 1980

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Dimension characterizations of complexity classes

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: Most of the hypotheses of full derandomization fall into two sets of equivalent statements: Those equivalent to the existence of efficient pseudorandom generators and those equivalent to approximating the accepting probability of a circuit. We give the first relativized world where these sets of equivalent statements are not equivalent to each other.