Abstract
We study how the nondeterminism versus determinism problem and the time versus space problem are related to the problem of derandomization. In particular, we show two ways of derandomizing the complexity class AM under uniform assumptions, which was only known previously under non-uniform assumptions [13],[14]. First, we prove that either AM = NP or it appears to any nondeterministic polynomial time adversary that NP is contained in deterministic subexponential time infinitely often. This implies that to any nondeterministic polynomial time adversary, the graph non-isomorphism problem appears to have subexponential-size proofs infinitely often, the first nontrivial derandomization of this problem without any assumption. Next, we show that either all BPP = P, AM = NP, and PH ⊆ ⊕P hold, or for any t(n) = 2Ω(n), DTIME (t(n)) ⊆ DSPACE(t ∈(n)) infinitely often for any constant ∈ > 0. Similar tradeoffs also hold for a whole range of parameters. This improves previous results [17]
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. E. Andreev, A. E. F. Clement, and J. D. P. Rolim, Hitting sets derandomize BPP, Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming, pages 357–368, 1996.
H. Buhrman, L. Fortnow, One-sided versus two-sided randomness, Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, pages 100–109, 1999.
L. Babai, L. Fortnow, N. Nisan, and A. Wigderson, BPP has subexponential time simulations unless EXPTIME has publishable proofs, Computational Complexity, 3(4), pp 307–318, 1993.
M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-rnadom bits, SIAM Journal on Computing, 13, pages 850–864, 1984.
N. Nisan and A. Wigderson, Hardness vs. randomness, Journal of Computer and System Sciences, 49, pages 149–167, 1994.
J. Hopcroft, W. Paul, and L. Valiant, On time versus space, Journal of ACM, 24, pages 332–337, 1977.
R. Impagliazzo, R. Shaltiel, and A. Wigderson, Near optimal conversion of hardness into pseudo-randomness, Proceedings of the 40th Annual IEEE Symposium on the Foundations of Computer Science, pages 181–190, 1999.
R. Impagliazzo, R. Shaltiel, and A. Wigderson, Extractors and pseudo-random generators with optimal seed length, Proceedings of the 32th Annual ACM Symposium on Theory of Computing, pages 1–10, 2000.
R. Impagliazzo and A. Wigderson, P=BPP if E requires exponential circuits: derandomizing the XOR lemma, Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 220–229, 1997.
R. Impagliazzo and A. Wigderson, Randomness vs. time: de-randomization under a uniform assumption, Proceedings of the 39th Annual IEEE Symposium on the Foundations of Computer Science, pages 734–743, 1998.
V. Kabanets, Easiness assumptions and hardness tests: trading time for zero error, In Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000.
R. M. Karp and R. Lipton, Turing machines that take advices, L’Ensignment Mathematique, 28, pages 191–209, 1982.
A. Klivans and D. van Melkebeek, Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses, Proceedings of the 31th Annual ACM Symposium on Theory of Computing, pages 659–667, 1999.
P. B. Miltersen and N. V. Vinodchandran, Derandomizing Arthur-Merlin games using hitting sets, Proceedings of the 40th Annual IEEE Symposium on the Foundations of Computer Science, 1999.
C. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
M. Saks, A. Srinivasan, and S. Zhou, Explicit OR-dispersers with polylogarithmic degree, Journal of ACM, 41(1), pages 123–154, 1998.
M. Sipser, Expanders, randomness, or time vs. space, Journal of Computer and System Sciences, 36, pages 379–383, 1988.
M. Sudan, L. Trevisan, and S. Vadhan, Pseudorandom generators without the XOR lemma, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 537–546, 1999.
S. Toda, PP is as hard as the polynomial-time hierarchy, SIAM Journal on Computing, 20(5), pages 865–877, 1991. 312 C.-J. Lu
L. Trevisan, Construction of near-optimal extractors using pseudo-random generators, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 141–148, 1999.
A. Yao, Theory and applications of trapdoor functions, Proceedings of the 23rd Annual IEEE Symposium on the Foundations of Computer Science, pages 80–91, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, CJ. (2000). Derandomizing Arthur-Merlin Games under Uniform Assumptions. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, SH. (eds) Algorithms and Computation. ISAAC 2000. Lecture Notes in Computer Science, vol 1969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40996-3_26
Download citation
DOI: https://doi.org/10.1007/3-540-40996-3_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41255-7
Online ISBN: 978-3-540-40996-0
eBook Packages: Springer Book Archive