Proving Lower Bounds Via Pseudo-random Generators

@inproceedings{Agrawal2005ProvingLB,
  title={Proving Lower Bounds Via Pseudo-random Generators},
  author={Manindra Agrawal},
  booktitle={FSTTCS},
  year={2005}
}
In this paper, we formalize two stepwise approaches, based on pseudo-random generators, for proving P 6= NP and its arithmetic analog: Permanent requires superpolynomial sized arithmetic circuits. 
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 143 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 97 extracted citations

A Guide to Learning Arithmetic Circuits

Electronic Colloquium on Computational Complexity • 2015
View 12 Excerpts
Highly Influenced

The GCT program toward the P vs. NP problem

Commun. ACM • 2012
View 10 Excerpts
Highly Influenced

Explicit Proofs and The Flip

ArXiv • 2010
View 4 Excerpts
Highly Influenced

Progress on Polynomial Identity Testing

Electronic Colloquium on Computational Complexity • 2009
View 10 Excerpts
Highly Influenced

Towards an algebraic natural proofs barrier via polynomial identity testing

Electronic Colloquium on Computational Complexity • 2017
View 3 Excerpts
Highly Influenced

Deterministic Divisibility Testing via Shifted Partial Derivatives

2015 IEEE 56th Annual Symposium on Foundations of Computer Science • 2015
View 4 Excerpts
Highly Influenced

143 Citations

01020'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 143 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Hardness vs

N. Nisan, A. Wigderson
randomness. J. Comput. Sys. Sci., 49(2):149–167, • 1994
View 6 Excerpts
Highly Influenced

Computational limitations on small depth circuits

J. H̊astad
PhD thesis, Massachusetts Institute of Technology, • 1986
View 4 Excerpts
Highly Influenced

On Derandomizing Tests for Certain Polynomial Identities

IEEE Conference on Computational Complexity • 2003
View 1 Excerpt

Similar Papers

Loading similar papers…