Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1997: Automata, Languages and Programming pp 177–187Cite as

Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs

  • Session 3: Computational Complexity
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1256))

Abstract

Up to know, the known derandomization methods have been derived assuming average-case hardness conditions. In this paper we instead present the first worst-case hardness conditions sufficient to obtain P=BPP.

Our conditions refer to the worst-case circuit complexity of Boolean operators computable in time exponential in the input size. Such results are achieved by a new method that departs significantly from the usual known methods based on pseudo-random generators.

Our method also gives a worst-case hardness condition for the circuit complexity of Boolean operators computable in NC (with respect to their output size) to obtain NC=BPNC.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ajtai M, Komlos J, and Szemeredi E. (1987), Deterministic simulation in LOGSPACE, Proc. of 19th ACM STOC, 132–140.

    Google Scholar 

  2. Alon N. (1986), “Eigenvalues and Expanders”, Combinatorica, 6, 83–96.

    Google Scholar 

  3. Andreev A., Clementi A., and Rolim J. (1996), “Hitting Sets Derandomize BPP”, in XXIII International Colloquium on Algorithms, Logic and Programming (ICALP'96), LNCS. Also available via ftp/WWW in the electronic journal ECCC (TR95-061)

    Google Scholar 

  4. Andreev A., Clementi A., Rolim J and Trevisan L. (1997), Weak Random Sources, Hitting Sets, and BPP Simulations”, Manuscript, February 1997.

    Google Scholar 

  5. Blum M., and Micali S. (1984), “How to generate cryptographically strong sequences of pseudorandom bits”, SIAM J. of Computing, 13(4), 850–864.

    Article  Google Scholar 

  6. Impagliazzo R., Wigderson A. (1997), “P=BPP unless E has subexponential circuits: Derandomizing the XOR Lemma”, to appear in 29th ACM STOC.

    Google Scholar 

  7. A. Lubotzky, R. Phillips, and P. Sarnak. (1988), “Ramanujan graphs”, Combinatorica, 8(3):261–277, 1988.

    Google Scholar 

  8. Lupanov, O.B. (1956) “About gating and contact-gating circuits”, Dokl. Akad. Nauk SSSR 111, 1171–11744.

    Google Scholar 

  9. Lupanov, O.B. (1965), “About a method circuits design — local coding principle”, Problemy Kibernet. 10, 31–110 (in Russian).

    Google Scholar 

  10. Nisan N., and Wigderson A. (1994), “Hardness vs Randomness”, J. Comput. System Sci. 49, 149–167 (also presented at the 29th IEEE FOCS, 1988).

    Google Scholar 

  11. Wegener, I. (1987), The complexity of finite Boolean functions, Wiley-Teubner Series in Computer Science.

    Google Scholar 

  12. Yao A. (1982), “Theory and applications of trapdoor functions”, in 23th IEEE FOCS, 80–91.

    Google Scholar 

  13. Zuckermann D. (1996), “Randomness-Optimal Sampling, Extractors, and Constructive leader Election”, in 28th ACM STOC, 286–295.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, University of Moscow, USSR

    Alexander E. Andreev

  2. Dip. di Scienze dell'Informazione, University “La Sapienza” of Rome, Italy

    Andrea E. F. Clementi

  3. Centre Universitaire d'Informatique, University of Geneva, CH

    José D. P. Rolim

Authors
  1. Alexander E. Andreev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea E. F. Clementi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. José D. P. Rolim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierpaolo Degano Roberto Gorrieri Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andreev, A.E., Clementi, A.E.F., Rolim, J.D.P. (1997). Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_175

Download citation

  • DOI: https://doi.org/10.1007/3-540-63165-8_175

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63165-1

  • Online ISBN: 978-3-540-69194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation