Abstract
In this paper, we formalize two stepwise approaches, based on pseudo-random generators, for proving P ≠ NP and its arithmetic analog: Permanent requires superpolynomial sized arithmetic circuits. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
APA
Agrawal, M. (2005). Proving lower bounds via pseudo-random generators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3821 LNCS, pp. 92–105). https://doi.org/10.1007/11590156_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free