PRIMES is in P M Agrawal, N Kayal, N Saxena Annals of mathematics, 781-793, 2004 | 2192 | 2004 |
Arithmetic circuits: A chasm at depth four M Agrawal, V Vinay 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 67-75, 2008 | 270 | 2008 |
Primality and identity testing via Chinese remaindering M Agrawal, S Biswas Journal of the ACM (JACM) 50 (4), 429-443, 2003 | 186 | 2003 |
Proving lower bounds via pseudo-random generators M Agrawal FSTTCS 2005: Foundations of Software Technology and Theoretical Computer …, 2005 | 167 | 2005 |
Jacobian hits circuits: hitting-sets, lower bounds for depth-d occur-k formulas & depth-3 transcendence degree-k circuits M Agrawal, C Saha, R Saptharishi, N Saxena Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 87 | 2012 |
On TC0, AC0, and arithmetic circuits M Agrawal, E Allender, S Datta Journal of Computer and System Sciences 60 (2), 395-421, 2000 | 82 | 2000 |
Annals of Mathematics M Agrawal, N Kayal, N Saxena PRIMES is in P 160, 781-798, 2004 | 79 | 2004 |
Hitting-sets for ROABP and sum of set-multilinear circuits M Agrawal, R Gurjar, A Korwar, N Saxena SIAM Journal on Computing 44 (3), 669-697, 2015 | 72 | 2015 |
Approximate verification of the symbolic dynamics of Markov chains M Agrawal, S Akshay, B Genest, PS Thiagarajan Journal of the ACM (JACM) 62 (1), 1-34, 2015 | 67 | 2015 |
Quasi-polynomial hitting-set for set-depth-Δ formulas M Agrawal, C Saha, N Saxena Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 61 | 2013 |
Reductions in circuit complexity: An isomorphism theorem and a gap theorem M Agrawal, E Allender, S Rudich Journal of Computer and System Sciences 57 (2), 127-143, 1998 | 60 | 1998 |
Reducing the complexity of reductions M Agrawal, E Allender, R Impagliazzo, T Pitassi, S Rudich Computational Complexity 10 (2), 117-138, 2001 | 53 | 2001 |
The Boolean isomorphism problem M Agrawal, T Thierauf Proceedings of 37th Conference on Foundations of Computer Science, 422-430, 1996 | 53 | 1996 |
The formula isomorphism problem M Agrawal, T Thierauf SIAM Journal on Computing 30 (3), 990-1009, 2000 | 50 | 2000 |
Equivalence of-algebras and cubic forms M Agrawal, N Saxena Annual Symposium on Theoretical Aspects of Computer Science, 115-126, 2006 | 41 | 2006 |
Automorphisms of finite rings and applications to complexity of problems M Agrawal, N Saxena Annual Symposium on Theoretical Aspects of Computer Science, 1-17, 2005 | 41 | 2005 |
Polynomial time truth-table reductions to P-selective sets M Agrawal, V Arvind Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory …, 1994 | 41 | 1994 |
Bootstrapping variables in algebraic circuits M Agrawal, S Ghosh, N Saxena Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 40 | 2018 |
Pseudo-random generators and structure of complete degrees M Agrawal Proceedings 17th IEEE Annual Conference on Computational Complexity, 139-147, 2002 | 40 | 2002 |
Determinant versus permanent M Agrawal European Mathematical Society, 2006 | 37 | 2006 |