Arithmetic Circuit Complexity
- Neeraj Kayal | Microsoft
Speaker Details
Neeraj Kayal obtained his PhD from the Indian Institute of Technology, Kanpur. He has been awarded the Gödel prize, the Fulkerson prize and the Distinguished Alumnus award of IITK for devising the first efficient deterministic primality testing algorithm along with his co-authors. He subsequently did a joint postdoctoral fellowship with the Institute for Advanced Study, Princeton and Rutgers University, New Jersey. He has been working with Microsoft Research Lab, India since 2008
-
-
Jeff Running
-
Neeraj Kayal
Principal Researcher
-
-
