Follow
Manindra Agrawal
Manindra Agrawal
Professor of Computer Science, IIT Kanpur
Verified email at iitk.ac.in - Homepage
Title
Cited by
Cited by
Year
PRIMES is in P
M Agrawal, N Kayal, N Saxena
Annals of mathematics, 781-793, 2004
20552004
Arithmetic circuits: A chasm at depth four
M Agrawal, V Vinay
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 67-75, 2008
2542008
Primality and identity testing via Chinese remaindering
M Agrawal, S Biswas
Journal of the ACM (JACM) 50 (4), 429-443, 2003
1852003
Proving lower bounds via pseudo-random generators
M Agrawal
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer …, 2005
1582005
On TC0, AC0, and arithmetic circuits
M Agrawal, E Allender, S Datta
Journal of Computer and System Sciences 60 (2), 395-421, 2000
822000
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
812012
Annals of Mathematics
M Agrawal, N Kayal, N Saxena
PRIMES is in P 160, 781-798, 2004
682004
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
672015
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
582013
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
561998
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
542015
Reducing the complexity of reductions
M Agrawal, E Allender, R Impagliazzo, T Pitassi, S Rudich
Computational Complexity 10 (2), 117-138, 2001
492001
The Boolean isomorphism problem
M Agrawal, T Thierauf
Proceedings of 37th Conference on Foundations of Computer Science, 422-430, 1996
491996
The formula isomorphism problem
M Agrawal, T Thierauf
SIAM Journal on Computing 30 (3), 990-1009, 2000
482000
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
411994
Pseudo-random generators and structure of complete degrees
M Agrawal
Proceedings 17th IEEE Annual Conference on Computational Complexity, 139-147, 2002
382002
Equivalence of -Algebras and Cubic Forms
M Agrawal, N Saxena
STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science …, 2006
352006
Automorphisms of finite rings and applications to complexity of problems
M Agrawal, N Saxena
STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science …, 2005
332005
Bootstrapping variables in algebraic circuits
M Agrawal, S Ghosh, N Saxena
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
322018
The Polynomially Bounded Perfect Matching Problem Is in NC 2
M Agrawal, TM Hoang, T Thierauf
STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science …, 2007
322007
The system can't perform the operation now. Try again later.
Articles 1–20