Resultado de búsqueda
Nitin Saxena (born 3 May 1981) is an Indian scientist in mathematics and theoretical computer science. His research focuses on computational complexity.
Nitin Saxena is a J.C.Bose Fellow and a Chair Professor of Computer Science and Engineering at IIT Kanpur. He works on Computational Complexity Theory, Algebra, Geometry and Number Theory.
Nitin Saxena (en hindi: नितन सक्सेना) (Allahabad, 3 de mayo de 1981) [1] es un informático teórico indio. Junto con Manindra Agrawal y Neeraj Kayal propusieron el Test de primalidad AKS en 2002, trabajo por el cual ganaron el Premio Gödel en 2006.
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.
The AKS primality test (also known as Agrawal–Kayal–Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian Institute of Technology Kanpur, on August 6, 2002, in an article titled "PRIMES is in P".
14 de sept. de 2023 · Prof. Nitin Saxena is a renowned researcher in computational complexity theory, algebra, geometry, and number theory. He won the Godel Prize and the Fulkerson Prize for his joint undergraduate thesis on primality testing, and is a recipient of the Shanti Swarup Bhatnagar Award and the INSA Young Scientist Medal.
26 de sept. de 2018 · Nitin Saxena. Not Artificially Intelligent. A huge congratulations 🎉 to Priyanka Golia from all of us at #NUSComputing for being selected as one of the EECS’s Rising Stars at the annual 2022 Rising Stars programme 🌟. 👉🏻 Story here: buff.ly/3QD2ROv #NUSComputing #PHD #Womenintech #AI #artificialintelligence.
