Neeraj Kayal
Publications
- Neeraj Kayal and Shubhangi Saraf, Blackbox Polynomial Identity Testing for Depth 3 Circuits, in Proceedings of FOCS 2009, IEEE Computer Society, October 2009
- Neeraj Kayal, The complexity of the annihilating polynomial, in Proceedings of the twenty-fourth Annual IEEE Conference on Computational Complexity (CCC), IEEE, July 2009
- Neeraj Kayal and Timur Nezhmetdinov, Factoring Groups Efficiently, in Proceedings of 36th ICALP , Springer Verlag, July 2009
- Neeraj Kayal and Nitin Saxena, Polynomial Identity Testing for Depth 3 Circuits, in Computational Complexity, vol. 16, no. 2, pp. 115-138, Springer Verlag, 2007
- Neeraj Kayal and Nitin Saxena, Complexity of Ring Morphism Problems, in Computational Complexity, vol. 15, no. 4, pp. 342-390, 2006
- Neeraj Kayal, Solvability of a System of Bivariate Polynomial Equations over a Finite Field, in Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, Springer, 2005
- Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, Primes is in P, in Annals of Mathematics, vol. 160, no. 2, pp. 781-793, 2004
