Highly Influenced

# Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits

@article{Agrawal2011JacobianHC, title={Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits}, author={Manindra Agrawal and Chandan Saha and Ramprasad Saptharishi and Nitin Saxena}, journal={Electronic Colloquium on Computational Complexity (ECCC)}, year={2011}, volume={18}, pages={143} }

- Published 2011 in Electronic Colloquium on Computational Complexity
DOI:10.1145/2213977.2214033

We present a single common tool to strictly subsume all known cases of polynomial time blackbox polynomial identity testing (PIT), that have been hitherto solved using diverse tools and techniques, over fields of zero or large characteristic. In particular, we show that polynomial time hitting-set generators for identity testing of the two seemingly different and well studied models - depth-3 circuits with bounded top fanin, and constant-depth constant-read multilinear formulas - can be… CONTINUE READING

Highly Cited

This paper has 55 citations. REVIEW CITATIONS

Recent Discussions

This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

#### From This Paper

##### Figures, tables, and topics from this paper.

37 Citations

0 References

Similar Papers