| |
| 2007 | ||
|---|---|---|
| 8 | EE | Neeraj Kayal, Nitin Saxena: Polynomial Identity Testing for Depth 3 Circuits. Computational Complexity 16(2): 115-138 (2007) |
| 2006 | ||
| 7 | EE | Neeraj Kayal, Nitin Saxena: Polynomial Identity Testing for Depth 3 Circuits. IEEE Conference on Computational Complexity 2006: 9-17 |
| 6 | EE | Neeraj Kayal, Nitin Saxena: Complexity of Ring Morphism Problems. Computational Complexity 15(4): 342-390 (2006) |
| 2005 | ||
| 5 | EE | Neeraj Kayal: Solvability of a System of Bivariate Polynomial Equations over a Finite Field. ICALP 2005: 551-562 |
| 4 | EE | Neeraj Kayal, Nitin Saxena: On the Ring Isomorphism and Automorphism Problems. IEEE Conference on Computational Complexity 2005: 2-12 |
| 3 | EE | Neeraj Kayal: Recognizing permutation functions in polynomial time. Electronic Colloquium on Computational Complexity (ECCC)(008): (2005) |
| 2 | EE | Neeraj Kayal, Nitin Saxena: Polynomial Identity Testing for Depth 3 Circuits Electronic Colloquium on Computational Complexity (ECCC)(150): (2005) |
| 2004 | ||
| 1 | EE | Neeraj Kayal, Nitin Saxena: On the Ring Isomorphism & Automorphism Problems Electronic Colloquium on Computational Complexity (ECCC)(109): (2004) |
| 1 | Nitin Saxena | [1] [2] [4] [6] [7] [8] |