Skip to main content
SpringerLink
Log in

Towards NEXP versus BPP?

  • Conference paper
Computer Science – Theory and Applications (CSR 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7913))

Included in the following conference series:

Abstract

We outline two plausible approaches to improving the miserable state of affairs regarding lower bounds against probabilistic polynomial time (namely, the class BPP).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andreev, A.E., Clementi, A.E.F., Rolim, J.D.P.: Worst-case hardness suffices for derandomization: A new method for hardness-randomness tradeoffs. TCS: Theoretical Computer Science 221(1-2), 3–18 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press (2009)

    Google Scholar 

  3. Babai, L., Fortnow, L., Nisan, N., Wigderson, A.: BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity 3(4), 307–318 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.P.: Short PCPs verifiable in polylogarithmic time. In: IEEE Conference on Computational Complexity, pp. 120–134 (2005)

    Google Scholar 

  5. Buhrman, H., Fortnow, L., Pavan, A.: Some results on derandomization. Theory Comput. Syst. 38(2), 211–227 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Goldreich, O., Wigderson, A.: On pseudorandomness with respect to deterministic observers. In: ICALP Satellite Workshops 2000, pp. 77–84 (2000)

    Google Scholar 

  7. Impagliazzo, R., Kabanets, V., Wigderson, A.: In search of an easy witness: Exponential time vs. probabilistic polynomial time. JCSS 65(4), 672–694 (2002)

    MathSciNet  MATH  Google Scholar 

  8. Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pp. 220–229 (1997)

    Google Scholar 

  9. Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity 13(1-2), 1–46 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Nisan, N., Wigderson, A.: Hardness vs randomness. JCSS 49(2), 149–167 (1994)

    MathSciNet  MATH  Google Scholar 

  11. Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the xor lemma. Journal of Computer System Sciences 62(2), 236–266 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Williams, R.: Improving exhaustive search implies superpolynomial lower bounds. In: ACM Symposium on Theory of Computing, pp. 231–240 (2010)

    Google Scholar 

  13. Williams, R.: Non-uniform ACC circuit lower bounds. In: IEEE Conference on Computational Complexity, pp. 115–125 (2011)

    Google Scholar 

  14. Williams, R.: Natural proofs versus derandomization. In: ACM Symposium on Theory of Computing (to appear, 2013)

    Google Scholar 

  15. Žák, S.: A Turing machine time hierarchy. Theoretical Computer Science 26(3), 327–333 (1983)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stanford University, USA

    Ryan Williams

Authors
  1. Ryan Williams
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Simon Fraser University, 8888 University Drive, V5A 1S6, Burnaby, BC, Canada

    Andrei A. Bulatov

  2. Institute of Mathematics and Computer Science, Ural Federal University, 51 Lenina Ave., 620083, Ekaterinburg, Russia

    Arseny M. Shur

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Williams, R. (2013). Towards NEXP versus BPP?. In: Bulatov, A.A., Shur, A.M. (eds) Computer Science – Theory and Applications. CSR 2013. Lecture Notes in Computer Science, vol 7913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38536-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38536-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38535-3

  • Online ISBN: 978-3-642-38536-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation