Nitin Saxena
- PRIMES is in P
2004/09/01 by Manindra Agrawal, Neeraj Kayal, Nitin Saxena · 6 citations
Computer Science · Mathematics · #Analytic Number Theory Research #Coding theory and cryptography #Polynomial and algebraic computation
- Progress on Polynomial Identity Testing - II
2014/01/06 by Nitin Saxena, Saxena, Nitin · 4 citations
Computer Science · Mathematics · #12Y05 #13P25 #68Q25 #68W30 #Algebraic Geometry (math.AG) #Commutative Algebra (math.AC) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.CC #cs.DM #math.AC #math.AG #msc:12Y05 #msc:13P25 #msc:68Q25 #msc:68W30
- Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics
2007/03/26 by Nitin Saxena, Saxena, Nitin, Simone Severini +3 · 2 citations
Physics and Astronomy · #FOS: Physical sciences #Quantum Physics (quant-ph) #quant-ph
- Hitting-sets for ROABP and Sum of Set-Multilinear circuits
2014/06/29 by Manindra Agrawal, Agrawal, Manindra, Rohit Gurjar +5 · 2 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Machine Learning and Algorithms #cs.CC
- Algebraic Independence and Blackbox Identity Testing
2011/02/14 by Malte Beecken, Johannes Mittmann, Beecken, Malte +3 · 1 citation
Computer Science · Mathematics · #13P25 #Commutative Algebra (math.AC) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #cs.CC #math.AC #msc:13P25
- Polynomial Interpolation and Identity Testing from High Powers over Finite Fields
2015/02/23 by Gabor Ivanyos, Gábor Ivanyos, Ivanyos, Gabor +11 · 1 citation
Computer Science · Mathematics · #Cryptography and Data Security #Cryptography and Residue Arithmetic #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT) #Quantum Computing Algorithms and Architecture #cs.DS #math.NT
- Counting basic-irreducible factors mod pk in deterministic poly-time\n and p-adic applications
2019/02/20 by Ashish Dwivedi, Rajat Mittal, Dwivedi, Ashish +3 · 1 citation
Computer Science · Mathematics · #Algebraic Geometry and Number Theory #Analytic Number Theory Research #Coding theory and cryptography #Computational Complexity (cs.CC) #Cryptography and Residue Arithmetic #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT) #Symbolic Computation (cs.SC)
- Computing Igusa's local zeta function of univariates in deterministic\n polynomial-time
2020/06/16 by Ashish Dwivedi, Dwivedi, Ashish, Nitin Saxena +1 · 1 citation
Computer Science · Mathematics · #11S40 #14G50 (Secondary) #68Q01 #68W30 (Primary) 11Y16 #Advanced Mathematical Identities #Analytic Number Theory Research #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT) #Polynomial and algebraic computation #Symbolic Computation (cs.SC)
- Quasi-polynomial Hitting-set for Set-depth-Delta Formulas
2012/09/11 by Manindra Agrawal, Agrawal, Manindra, Chandan Saha +3 · 1 citation
Computer Science · Engineering · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Cryptography and Data Security #FOS: Computer and information sciences #Low-power high-performance VLSI design #cs.CC