Go to content
- {{#headlines}}
- {{title}} {{/headlines}}
Profile
| Academic position | Full Professor |
|---|---|
| Research fields | Theoretical Computer Science,Algebra, Theory of Numbers, Algebraic Geometry |
| Keywords | Theory of Computation, Complexity Theory, Algorithmic Number Theory |
Current contact address
| Country | India |
|---|---|
| City | Kanpur Nagar |
| Institution | Indian Institute of Technology (IIT) Kanpur |
| Institute | Department of Computer Science and Engineering |
| Homepage | http://www.cse.iitk.ac.in/users/manindra/ |
Host during sponsorship
| Prof. Dr. Uwe Schöning | Institut für Theoretische Informatik, Universität Ulm, Ulm |
|---|---|
| Prof. Dr. Dr. h.c. mult. Kurt Mehlhorn | Abteilung 1: Algorithmen und Komplexität, Max-Planck-Institut für Informatik, Saarbrücken |
| Start of initial sponsorship | 01/09/1995 |
Program(s)
| 1995 | Humboldt Research Fellowship Programme |
|---|---|
| 2010 | Humboldt Research Award Programme |
Nominator's project description
| Professor Manindra Agrawal is an international authority in theoretical computer science. In 2002, Professor Agrawal and his students Kayal and Saxena discovered a deterministic polynomial-time algorithm for testing primalty, which was a break-through and became known all over the world. During his stay in Germany he intends to work on another long-standing open problem in complexity theory: The Polynomial Identity Testing. |