1. Jacobian hits circuits: hitting-sets, lower bounds for depth-d occur-k formulas & depth-3 transcendence degree-k circuits;Agrawal,2012
2. Arithmetic circuits and counting complexity classes;Allender,2004
3. The complexity of matrix rank and feasible systems of linear equations;Allender;Comput. Complex.,1999
4. Relationships among PL, #L, and the determinant;Allender;ITA,1996
5. Derandomizing polynomial identity testing for multilinear constant-read formulae;Anderson,2011