Skip to main content

On the Limit of Some Algorithmic Approach to Circuit Lower Bounds

  • Chapter
  • First Online:
Computing with New Resources

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

  • 934 Accesses

Abstract

We propose a framework — generic algorithm framework — for studying the limit of a certain algorithmic approach for showing circuit lower bounds. We show some illustrative examples for explaining the motivation/justification of our framework while leaving one key technical and very challenging problem open. We hope that this framework is useful for investigating the limit of algorithmic approaches to define computationally hard problems.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Aaronson, S.: Oracles are subtle but not malicious. In: Proc. IEEE Conference on Computational Complexity (CCC 2006), pp. 340–354. IEEE (2006)

    Google Scholar 

  2. Baker, T., Gill, J., Solovay, R.: Relativizations of the P=?NP question. SIAM J. Comput. 4, 431–442 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bshouty, N.H., Cleve, R., Gavaldà, R., Kannan, S.: Oracles and queries that are sufficient for exact learning. J. Comput. Sys. Sci. 52(3), 421–433 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cai, J.Y.: \({S}^{p}_2\) \(\subseteq \) ZPPNP. In: Proc. of the 42nd Annual Sympos. on Foundations of Comp. Sci. pp. 620–629. IEEE (2001)

    Google Scholar 

  5. Cai, J., Watanabe, O.: On proving circuit lower bounds against the polynomial-time hierarchy. SIAM Journal on Computing 33(4), 984–1009 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kannan, R.: Circuit-size lower bounds and non-reducibility to sparse sets. Information and Control 55(1), 40–56 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  7. Karp, R.M., Lipton, R.J.: Turing machines that take advice. Enseign. Math. 28, 191–201 (1982)

    MathSciNet  MATH  Google Scholar 

  8. Köbler, J., Watanabe, O.: New collapse consequences of np having small circuits. SIAM Journal on Computing 28(1), 311–324 (1998)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Osamu Watanabe .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Watanabe, O. (2014). On the Limit of Some Algorithmic Approach to Circuit Lower Bounds. In: Calude, C., Freivalds, R., Kazuo, I. (eds) Computing with New Resources. Lecture Notes in Computer Science(), vol 8808. Springer, Cham. https://doi.org/10.1007/978-3-319-13350-8_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13350-8_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13349-2

  • Online ISBN: 978-3-319-13350-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics