Nitin Saxena 个人学术档案 - 学术资源搜索

引用次数

	总计	2019 年至今
引用	4166	1355
h 指数	25	19
i10 指数	44	31

320

160

240

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202474 95 120 125 119 142 168 168 175 163 238 195 199 229 215 264 198 206 288 310 209 142

开放获取的出版物数量

查看全部

27 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Manindra AgrawalProfessor of Computer Science, IIT Kanpur在 iitk.ac.in 的电子邮件经过验证
Rohit GurjarCalifornia institute of technology在 caltech.edu 的电子邮件经过验证
Arpita KorwarPost-doctorate, IMJ-PRG, University of Paris在 imj-prg.fr 的电子邮件经过验证
Pranjal DuttaPostdoctoral Reseacher at School of Computing, NUS在 nus.edu.sg 的电子邮件经过验证
Gabor IvanyosSZTAKI - Institute for Computer Science and Control在 sztaki.hu 的电子邮件经过验证
C. SeshadhriUniversity of California, Santa Cruz在 ucsc.edu 的电子邮件经过验证
Chandan SahaIndian Institute of Science在 iisc.ac.in 的电子邮件经过验证
Marek KarpinskiProfessor of Computer Science, University of Bonn在 cs.uni-bonn.de 的电子邮件经过验证
Ramprasad SaptharishiTata Institute of Fundamental Research在 tifr.res.in 的电子邮件经过验证
Sumanta GhoshPostdoctoral Fellow, Caltech在 caltech.edu 的电子邮件经过验证
Igor ShparlinskiUNSW在 unsw.edu.au 的电子邮件经过验证
Ashish DwivediPosdoctoral Scholar, The Ohio State在 osu.edu 的电子邮件经过验证
Prateek DwivediPhD Student, IIT Kanpur在 cse.iitk.ac.in 的电子邮件经过验证
Simone SeveriniAWS/UCL在 ucl.ac.uk 的电子邮件经过验证
Rajat MittalIIT Kanpur在 iitk.ac.in 的电子邮件经过验证
Zeyu GuoThe Ohio State University在 osu.edu 的电子邮件经过验证
Pranav BishtIndian Institute of Technology (Indian School of Mines) Dhanbad在 iitism.ac.in 的电子邮件经过验证
Lajos RónyaiBME, SZTAKI在 ilab.sztaki.hu 的电子邮件经过验证
C.S. BhargavPhD student, IIT Kanpur在 cse.iitk.ac.in 的电子邮件经过验证
Miklos SanthaSenior researcher in Computer Science, CNRS Paris and CQT Singapore在 liafa.univ-paris-diderot.fr 的电子邮件经过验证

关注

Nitin Saxena

N.Rama.Rao.Professor & J.C.Bose.Fellow, CSE, IIT Kanpur; FNA FASc FNASc FNAE

在 cse.iitk.ac.in 的电子邮件经过验证 - 首页

Complexity theory Algebra Number theory Algebraic geometry Algebraic combinatorics


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
PRIMES is in P M Agrawal, N Kayal, N Saxena Annals of mathematics, 781-793, 2004	2191	2004
Progress on Polynomial Identity Testing. N Saxena Bull. EATCS 99, 49-79, 2009	139	2009
Polynomial identity testing for depth 3 circuits N Kayal, N Saxena computational complexity 16 (2), 115-138, 2007	127	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	113	2007
Diagonal circuit identity testing and lower bounds N Saxena Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008	108	2008
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
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	82	2011
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	80	2013
Annals of Mathematics M Agrawal, N Kayal, N Saxena PRIMES is in P 160, 781-798, 2004	79	2004
Algebraic independence and blackbox identity testing M Beecken, J Mittmann, N Saxena Information and Computation 222, 2-19, 2013	76	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	71	2015
An almost optimal rank bound for depth-3 identities N Saxena, C Seshadhri SIAM journal on computing 40 (1), 200-224, 2011	65	2011
Progress on polynomial identity testing-II N Saxena Perspectives in Computational Complexity: The Somenath Biswas Anniversary …, 2014	64	2014
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
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	58	2017
Deterministic polynomial time algorithms for matrix completion problems G Ivanyos, M Karpinski, N Saxena SIAM journal on computing 39 (8), 3736-3751, 2010	48	2010
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
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
A case of depth-3 identity testing, sparse factorization and duality C Saha, R Saptharishi, N Saxena Computational Complexity 22 (1), 39-69, 2013	38	2013

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用