Derandomization and distinguishing complexity

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2003, Pages 209-220

  Allender, Eric ^a   Koucký, Michal ^a   Roy, Sambuddha ^a   Ronneburger, Detlef ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; THEOREM PROVING; TURING MACHINES; ARTIFICIAL INTELLIGENCE; BINARY DECISION DIAGRAMS; CHROMIUM; NETWORKS (CIRCUITS);

DERANDOMIZATION; BRANCHING PROGRAMS; HITTING SET GENERATORS; KOLMOGOROV COMPLEXITY; NON-DETERMINISTIC TIME; ORACLE ACCESS; RANDOM STRING; RESOURCE-BOUNDED;

COMPUTER SCIENCE; ALUMINUM;

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

References (26)

1. E. Allender. Some consequences of the existence of pseudorandom generators. Journal of Computer and System Sciences, 39:101-124, 1989.
2. E. Allender. When worlds collide: Derandomization, lower bounds, and Kolmogorov complexity. In Proc. Conf. on Found. of Software Technology and Theo. Comp. Sci. (FST&TCS), volume 2245 of Lecture Notes in Computer Science, pages 1-15, 2001.
3. E. Allender, H. Buhrman, M. Koucký, D. van Melkebeek, and D. Ronneburger. Power from random strings. In Proc. IEEE Symp. on Found. of Comp. Sci. (FOCS), pages 669-678, 2002.
4. NP and other lowness results. Technical Report TR99-033, Electronic Colloquium on Computational Complexity, 1999.
5. V. Arvind, J. Koebler, and R. Schuler. On helping and interactive proof systems. International Journal of Foundations of Computer Science (IJFCS), 6(2):137-153, 1995.
6. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3:307-318, 1993.
7. E. Biham, D. Boneh, and O. Reingold. Breaking generalized Diffie-Hellmann modulo a composite is no easier than factoring. In Information Processing Letters 70(2), pages 83-87, 1999.
8. H. Buhrman, L. Fortnow, and S. Laplante. Resource-bounded Kolmogorov complexity revisited. SIAM Journal on Computing, 31(3):887-905, 2002.
9. J. Cai, A. Condon, and R. J. Lipton. PSPACE is provable by two provers in one round. Journal of Computer and System Sciences, 48:183-193, 1994.
10. S. Czort. The complexity of minimizing disjunctive normal form fomulas. Master's thesis, University of Aarhus, 1999.
11. L. Fortnow. Comparing notions of full derandomization. In Proc. IEEE Conf. on Computational Complexity '01, pages 28-34, 2001.
12. L. Fortnow and M. Kummer. On resource-bounded instance complexity. Theoretical Computer Science, 161(1-2): 123-140, 1996.
13. 1-e. Acta Mathematica, 182:105-142, 1999.
14. W. Hesse, E. Allender, and D. Barrington. Uniform constant-depth threshold circuits for division and iterated multiplication. Journal of Computer and System Sciences, 65:695-716, 2002.
15. R. Impagliazzo, V. Kabanets, and A. Wigderson. In search of an easy witness: Exponential time vs. probabilistic polynomial time. In Proc. IEEE Conf. on Computational Complexity, pages 2-12, 2001.
16. R. Impagliazzo, R. Shaltiel, and A. Wigderson. Near-optimal conversion of hardness into pseudo-randomness. In Proc. IEEE Symp. on Found. of Comp. Sci. (FOCS), pages 181-190, 1999.
17. V. Kabanets and J.-Y. Cai. Circuit minimization problem. In Proc. ACM Symp. on Theory of Computing (STOC), pages 73-79, 2000.
18. A. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM Journal on Computing, 2002. To appear; a preliminary version appeared in STOC'99.
19. L. A. Levin. Randomness conservation inequalities; information and independence in mathematical theories. Information and Control, 61:15-37, 1984.
20. O. B. Lupanov. A method of circuit synthesis. Izvestiya VUZ, Radiofizika, 1(1):120-140, 1959.
21. W. Masek. Some NP-complete set covering problems. Unpublished manuscript, 1979.
22. P. B. Miltersen and N. V. Vinodchandran. Derandomizing Arthur-Merlin games using hitting sets. In Proc. IEEE Symp. on Found. of Comp. Sci. (FOCS), pages 71-80, 1999.
23. M. Naor and O. Reingold. Number-theoretic constructions of efficient pseudorandom functions. In Proc. IEEE Symp. on Found. of Comp. Sci. (FOCS), pages 458-467, 1997.
24. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
25. S. Rudich. Super-bits, demi-bits, and NP/qpoly-natural proofs. In Proceedings of RANDOM, volume 1269 of Lecture Notes in Computer Science, 1997.
26. R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudo-random generator. In Proc. IEEE Symp. on Found. of Comp. Sci. (FOCS), pages 648-657, 2001.