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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aaronson, S.: Oracles are subtle but not malicious. In: Proc. IEEE Conference on Computational Complexity (CCC 2006), pp. 340–354. IEEE (2006)
Baker, T., Gill, J., Solovay, R.: Relativizations of the P=?NP question. SIAM J. Comput. 4, 431–442 (1975)
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)
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)
Cai, J., Watanabe, O.: On proving circuit lower bounds against the polynomial-time hierarchy. SIAM Journal on Computing 33(4), 984–1009 (2004)
Kannan, R.: Circuit-size lower bounds and non-reducibility to sparse sets. Information and Control 55(1), 40–56 (1982)
Karp, R.M., Lipton, R.J.: Turing machines that take advice. Enseign. Math. 28, 191–201 (1982)
Köbler, J., Watanabe, O.: New collapse consequences of np having small circuits. SIAM Journal on Computing 28(1), 311–324 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)