Search results
Nitin Saxena. N.Rama.Rao.Chair Professor + J.C.Bose Fellow ; FNA FASc FNASc FNAE. Department of Computer Science and Engineering. IIT Kanpur. India. I completed my Bachelors in Computer Science from the Indian Institute of Technology, Kanpur in 2002 and completed my PhD under Manindra Agrawal in 2006.
Nitin Saxena (born 3 May 1981) is an Indian scientist in mathematics and theoretical computer science. His research focuses on computational complexity.
Sep 14, 2023 · Prof. Nitin Saxena is a highly acclaimed computer scientist who shook the global scientific community by the sheer brilliance and simplicity of his groundbreaking work in the early 2000s.
Email: nitin[AT]cse.iitk.ac.in. Office Phone: 0512-259-7588. Associate Professor, Department of Computer Science and Engineering
Nitin Saxena. N.Rama.Rao.Professor & J.C.Bose.Fellow, CSE, IIT Kanpur; FNA FASc FNASc FNAE. Verified email at cse.iitk.ac.in - Homepage. Complexity theory Algebra Number theory Algebraic geometry Algebraic combinatorics. ... A Korwar, N Saxena. SIAM Journal on Computing 44 (3), 669-697, 2015. 69: 2015: An almost optimal rank bound for depth-3 identities. N Saxena, C Seshadhri. SIAM journal on computing 40 (1), 200-224, 2011. 64: 2011: Progress on polynomial identity testing-II.
2006-IEEE Conference on Computational Complexity Awards, Awarded both the Best Paper Award and the Ronald V. Book Best Student Paper Award for the joint paper Polynomial Identity Testing for Depth 3 Circuits. 2010-IITK@50, Amongst the top 50 alumni, voted by the IIT-K Alumni to celebrate 50 years.
Personal Information. Name: Nitin SAXENA. Address: RM203, Department of CSE, IIT Kanpur, Kanpur-208016 ; +91-512-679-7588. E-address: nitin@cse.iitk.ac.in ; https://www.cse.iitk.ac.in/users/nitin/ Date and place of birth: 3rd MAY 1981, Prayagraj, India. Nationality: INDIA Gender: M. 3 Post-Doc Research. Mathematics, Informatics, Quantum complexity
Nitin Saxena. IIT, Kanpur. Nitin Saxena completed his Bachelors in Computer Science from the IIT, Kanpur in 2002 and completed PhD under Manindra Agrawal in 2006. His research interests are computational complexity theory, algebra, geometry and number theory.
Surveys. How easy is it to describe hard polynomials?: Technical Perspective [Opinion] Communications of the ACM, vol.67 (2), pp.100, 2024. (Invited by the editor). [ pdf] Research in theoretical computer science. [Big trends] with Meena Mahajan and Madhavan Mukund Communications of the ACM, 62 (11), 92-95, 2019.
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".
