Manindra Agrawal
Manindra Agrawal (born May 20, 1966 in Allahabad , India ) is an Indian mathematician and computer scientist who deals with cryptography, complexity theory and algorithmic number theory.
Life
Agrawal has been Professor of Computer Science at the Indian Institute of Technology Kanpur since 2001 , where he also studied Computer Science (Bachelor's degree in 1986) and received his PhD in 1991. In 1996 he was assistant professor there and in 1999 associate professor. Among other things, he was visiting professor in Singapore, at Ulm University (as a Humboldt Fellow 1995/96) and at the Institute for Advanced Study in 2003/04 .
In 2002 he received the Clay Research Award for the development of an algorithm for the prime number test ( AKS prime number test , published in August 2002 together with his then students Neeraj Kayal and Nitin Saxena ), the time complexity of which increases polynomially with the length of the binary representation of the number examined. By proving the possibility of distinguishing prime numbers from pseudoprime numbers in polynomial time , they confirmed a conjecture by Agrawal and Somenath Biswas from 1999.
In 2006 he received the Fulkerson Prize and the Gödel Prize . In 2006 he was invited speaker at the International Congress of Mathematicians in Madrid ( determinant versus permanent ). In 2015 he was elected to the National Academy of Sciences .
Web links
- Homepage in Kanpur
- Biography at the Clay Mathematics Institute ( Memento from November 18, 2013 in the Internet Archive )
Individual evidence
- ↑ Agrawal, Kayal, Saxena Primes is in P , Annals of Mathematics, Vol. 160, 2004, pp. 781-793.
| personal data | |
|---|---|
| SURNAME | Agrawal, Manindra |
| BRIEF DESCRIPTION | Indian mathematician |
| DATE OF BIRTH | May 20, 1966 |
| PLACE OF BIRTH | Allahabad , India |