Nitin Saxena
Cited by
Cited by
PRIMES is in P
M Agrawal, N Kayal, N Saxena
Annals of mathematics, 781-793, 2004
Polynomial identity testing for depth 3 circuits
N Kayal, N Saxena
computational complexity 16 (2), 115-138, 2007
Parameters of integral circulant graphs and periodic quantum dynamics
N Saxena, S Severini, IE Shparlinski
International Journal of Quantum Information 5 (03), 417-430, 2007
Progress on Polynomial Identity Testing.
N Saxena
Bulletin of the EATCS 99, 49-79, 2009
Diagonal circuit identity testing and lower bounds
N Saxena
International Colloquium on Automata, Languages, and Programming, 60-71, 2008
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth- Occur- Formulas and Depth-3 Transcendence Degree- Circuits
M Agrawal, C Saha, R Saptharishi, N Saxena
SIAM Journal on Computing 45 (4), 1533-1562, 2016
Blackbox identity testing for bounded top-fanin depth-3 circuits: The field doesn't matter
N Saxena, C Seshadhri
SIAM Journal on Computing 41 (5), 1285-1298, 2012
From Sylvester-Gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits
N Saxena, C Seshadhri
Journal of the ACM (JACM) 60 (5), 1-33, 2013
Progress on polynomial identity testing-II
N Saxena
Perspectives in Computational Complexity, 131-146, 2014
An almost optimal rank bound for depth-3 identities
N Saxena, C Seshadhri
SIAM journal on computing 40 (1), 200-224, 2011
Annals of Mathematics
M Agrawal, N Kayal, N Saxena
PRIMES is in P 160, 781-798, 2004
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
Deterministic polynomial time algorithms for matrix completion problems
G Ivanyos, M Karpinski, N Saxena
SIAM journal on computing 39 (8), 3736-3751, 2010
Algebraic independence and blackbox identity testing
M Beecken, J Mittmann, N Saxena
Information and Computation 222, 2-19, 2013
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
Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
R Gurjar, A Korwar, N Saxena, T Thierauf
computational complexity 26 (4), 835-880, 2017
Equivalence of -Algebras and Cubic Forms
M Agrawal, N Saxena
Annual Symposium on Theoretical Aspects of Computer Science, 115-126, 2006
A case of depth-3 identity testing, sparse factorization and duality
C Saha, R Saptharishi, N Saxena
Computational Complexity 22 (1), 39-69, 2013
On the ring isomorphism & automorphism problems
N Kayal, N Saxena
20th Annual IEEE Conference on Computational Complexity (CCC'05), 2-12, 2005
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
The system can't perform the operation now. Try again later.
Articles 1–20