Abstract
We show several results about derandomization including 1. If NP is easy on average then efficient pseudorandom generators exist and P = BPP. 2. If NP is easy on average then given an NP machine M we can easily on average find accepting computations of M(x) when it accepts. 3. For any A in EXP, if NEXPA is in PA/poly then NEXPA = EXPA. 4. If A is ⌆p k -complete and NEXPA is in PA/poly then NEXPA = EXP = MAA.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70–122, January 1998.
L. Babai. Trading group theory for randomness. In Proceedings of the 17th ACM Symposium on the Theory of Computing, pages 421–429. ACM, New York, 1985.
L. Babai, L. Fortnow, L. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In Proceedings of the 23rd ACM Symposium on the Theory of Computing, pages 21–31. ACM, New York, 1991.
L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has twoprover interactive protocols. Computational Complexity, 1(1):3–40, 1991.
L. Babai and S. Moran. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences, 36(2):254–276, 1988.
S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the theory of average case complexity. Journal of Computer and System Sciences, 44:193–219, 1992.
A. Blass and Y. Gurevich. Randomizing reductions of search problems. SIAM Journal of Computing, 22:949–975, 1993.
H. Buhrman, L. Fortnow, and T. Thierauf. Nonrelativizing separations. In Proceedings of the 13th IEEE Conference on Computational Complexity, pages 8–12. IEEE, New York, 1998.
H. Buhrman and S. Homer. Superpolynomial circuits, almost sparse oracles and the exponential hierarchy. In Proceedings of the 12th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science, pages 116–127. Springer, Berlin, Germany, 1992.
L. Fortnow, J. Rompel, and M. Sipser. On the power of multi-prover interactive protocols. Theoretical Computer Science A, 134:545–557, 1994.
R. Impagliazzo, V. Kabanets, and A. Wigderson. In search of an easy witness: Exponential versus probabilistic time. In Proceedings of the 16th IEEE Conference on Computational Complexity, pages 2–12. IEEE, New York, 2001.
R. Impagliazzo and L. Levin. No better ways to generate hard NP instances than picking uniformly at random. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 812–821. IEEE Computer Society Press, 1990.
R. Impagliazzo and G. Tardos. Decision versus search problems in superpolynomial time. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pages 222–227. IEEE, New York, 1989.
R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th ACM Symposium on the Theory of Computing, pages 220–229. ACM, New York, 1997.
R. Impagliazzo and A. Wigderson. Randomness vs. time: Derandomization under a uniform assumption. Journal of Computer and System Sciences, 63(4):672–688, December 2001.
R. Kannan. Circuit-size lower bounds and non-reducibility to sparse sets. Information and Control, 55:40–56, 1982.
A. Klivans and D. van Melkebeek. Graph nonisomorhism has subexponential size proofs unless the polynomial-time hierarchy collapses. In Proceedings of the 31st ACM Symposium on the Theory of Computing, pages 659–667. ACM, New York, 1999.
J. Köbler and R. Schuler. Average-case intractability vs. worst-case intractability. In The 23rd International Symposium on Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 493–502. Springer, 1998.
L. Levin. Average case complete problems. SIAM Journal on Computing, 15:285–286, 1986.
P. Miltersen and V. Vinodchandran. Derandomizing Arthur-Merlin games using hitting sets. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 71–80. IEEE, New York, 1999.
A. Polishchuk and D. Spielman. Nearly-linear size holographic proofs. In Proceedings of the 26th ACM Symposium on the Theory of Computing, pages 194–203. ACM, New York, 1994.
R. Schuler and O. Watanabe. Towards average-case complexity analysis of NP optimization problems. In Proceedings of the tenth Annual Conference in complexity theory, pages 148–161. IEEE Computer Society, 1995.
L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85–93, 1986.
J. Wang. Average-case computational complexity theory. In L. Hemaspaandra and A. Selman, editors, Complexity Theory Retrospective II, pages 295–328. Springer, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buhrman, H., Fortnow, L., Pavan, A. (2003). Some Results on Derandomization. In: Alt, H., Habib, M. (eds) STACS 2003. STACS 2003. Lecture Notes in Computer Science, vol 2607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36494-3_20
Download citation
DOI: https://doi.org/10.1007/3-540-36494-3_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00623-7
Online ISBN: 978-3-540-36494-8
eBook Packages: Springer Book Archive