Takip et
Nitin Saxena
Nitin Saxena
N.Rama.Rao.Professor & J.C.Bose.Fellow, CSE, IIT Kanpur; FNA FASc FNASc FNAE
cse.iitk.ac.in üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
PRIMES is in P
M Agrawal, N Kayal, N Saxena
Annals of mathematics, 781-793, 2004
23172004
Progress on Polynomial Identity Testing.
N Saxena
Bull. EATCS 99, 49-79, 2009
1502009
Polynomial identity testing for depth 3 circuits
N Kayal, N Saxena
computational complexity 16 (2), 115-138, 2007
1282007
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
1212007
Diagonal circuit identity testing and lower bounds
N Saxena
Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008
1122008
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
912012
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
842013
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter
N Saxena, C Seshadhri
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
842011
Annals of Mathematics
M Agrawal, N Kayal, N Saxena
PRIMES is in P 160, 781-798, 2004
842004
Algebraic independence and blackbox identity testing
M Beecken, J Mittmann, N Saxena
Information and Computation 222, 2-19, 2013
812013
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
762015
Progress on polynomial identity testing-II
N Saxena
Perspectives in Computational Complexity: The Somenath Biswas Anniversary …, 2014
742014
An almost optimal rank bound for depth-3 identities
N Saxena, C Seshadhri
SIAM journal on computing 40 (1), 200-224, 2011
652011
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
642013
Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
R Gurjar, A Korwar, N Saxena, T Thierauf
computational complexity 26, 835-880, 2017
612017
Deterministic polynomial time algorithms for matrix completion problems
G Ivanyos, M Karpinski, N Saxena
SIAM journal on computing 39 (8), 3736-3751, 2010
592010
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
452005
Bootstrapping variables in algebraic circuits
M Agrawal, S Ghosh, N Saxena
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
442018
Equivalence of-algebras and cubic forms
M Agrawal, N Saxena
Annual Symposium on Theoretical Aspects of Computer Science, 115-126, 2006
432006
A case of depth-3 identity testing, sparse factorization and duality
C Saha, R Saptharishi, N Saxena
Computational Complexity 22 (1), 39-69, 2013
412013
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20
OSZAR »