Comparing notions of full derandomization

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 28-34

  Fortnow, L ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; EQUIVALENCE CLASSES; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

FULL DERANDOMIZATION; PSEUDORANDOM GENERATORS;

COMPUTATIONAL COMPLEXITY;

EID: 0034873507     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. A new general derandomization method
2. Weak random sources, hitting sets, and BPP simulations
3. One-sided versus two-sided randomness
4. Non-deterministic exponential time has two-prover interactive protocols
5. BPP has subexponential simulations unless EXPTIME has publishable proofs
6. A with probability one
7. Relativizations of the P = NP question
8. The complexity of promise problems with applications to public-key cryptography
9. The role of relativization in complexity theory
10. Relativized polynomial hierarchies extending two levels
11. On relativized exponential and probabilistic complexity classes
12. In search of an easy witness: Exponential versus probabilistic time
13. Decision trees and downward closures
14. Near-optimal conversion of hardness into pseudo-randomness
15. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma
16. Randomness vs. time: De-randomization under a uniform assumption
17. Circuit minimization problem
18. Efficiently approximable real-valued functions
19. Sparse sets in NP-P: Relativizations
20. Graph nonisomorhism has subexponential size proofs unless the polynomial-time hierarchy collapses
21. BPP and the polynomial hierarchy
22. Algebraic methods for interactive proof systems
23. A general method to construct oracles realizing given relationships between complexity classes