Skip to main content
SpringerLink
Log in

Diagonalization Strikes Back: Some Recent Lower Bounds in Complexity Theory

  • Conference paper
Computing and Combinatorics (COCOON 2011)

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

Included in the following conference series:

  • 828 Accesses

Abstract

The area of complexity lower bounds is concerned with proving impossibility results for bounded-resource computation. In spite of its apparent weaknesses, the ancient method of diagonalization has played a key role in recent lower bounds. This short article briefly recalls diagonalization along with its strengths and weaknesses, and describes a little about how diagonalization has made a recent comeback in complexity theory (although many would argue that it never really went away).

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

References

  1. Baker, T., Gill, J., Solovay, R.: Relativizations of the P = NP question. SIAM Journal on Computing 4(4), 431–442 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  2. Fortnow, L.: Nondeterministic polynomial time versus nondeterministic logarithmic space: Time-space tradeoffs for satisfiability. In: IEEE Conference on Computational Complexity (CCC), pp. 52–60 (1997)

    Google Scholar 

  3. Fortnow, L., Lipton, R., van Melkebeek, D., Viglas, A.: Time-space lower bounds for satisfiability. JACM 52(6), 835–865 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fürer, M.: The tight deterministic time hierarchy. In: ACM Symposium on Theory of Computing, pp. 8–16 (1982)

    Google Scholar 

  5. Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Transactions of the American Mathematical Society 117, 285–306 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hennie, F.C., Stearns, R.E.: Two-tape simulation of multitape Turing machines. JACM 13(4), 533–546 (1966)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  8. Williams, R.: Non-uniform ACC circuit lower bounds. To appear in IEEE Conference on Computational Complexity, CCC (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Almaden Research Center, 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. Department of Computer Science, University of Texas-Pan American, 78539, Edinburg, TX, USA

    Bin Fu

  2. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Williams, R. (2011). Diagonalization Strikes Back: Some Recent Lower Bounds in Complexity Theory. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22685-4_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22684-7

  • Online ISBN: 978-3-642-22685-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation