On the Limit of Some Algorithmic Approach to Circuit Lower Bounds

  • Osamu WatanabeEmail author
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8808)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Aar06]
    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. [Betal75]
    Baker, T., Gill, J., Solovay, R.: Relativizations of the P=?NP question. SIAM J. Comput. 4, 431–442 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  3. [Betal96]
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  4. [Betal96]
    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. [CW04]
    Cai, J., Watanabe, O.: On proving circuit lower bounds against the polynomial-time hierarchy. SIAM Journal on Computing 33(4), 984–1009 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  6. [Kan82]
    Kannan, R.: Circuit-size lower bounds and non-reducibility to sparse sets. Information and Control 55(1), 40–56 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  7. [KL82]
    Karp, R.M., Lipton, R.J.: Turing machines that take advice. Enseign. Math. 28, 191–201 (1982)MathSciNetzbMATHGoogle Scholar
  8. [KW98]
    Köbler, J., Watanabe, O.: New collapse consequences of np having small circuits. SIAM Journal on Computing 28(1), 311–324 (1998)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Department of Mathematical and Computing SciencesTokyo Institute of TechnologyTokyoJapan

Personalised recommendations