Neeraj Kayal

	2012
25		Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam: Reconstruction of depth-4 multilinear circuits with top fan-in 2. STOC 2012: 625-642
24		Neeraj Kayal: Affine projections of polynomials: extended abstract. STOC 2012: 643-662
23		Ankit Gupta, Neeraj Kayal, Youming Qiao: Random Arithmetic Formulas can be Reconstructed Efficiently. Electronic Colloquium on Computational Complexity (ECCC) 19: 33 (2012)
	2011
22		Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam: Efficient Reconstruction of Random Multilinear Formulas. FOCS 2011: 778-787
21		Neeraj Kayal, Chandan Saha: On the Sum of Square Roots of Polynomials and Related Problems. IEEE Conference on Computational Complexity 2011: 292-299
20		Neeraj Kayal: Efficient algorithms for some special cases of the polynomial equivalence problem. SODA 2011: 1409-1421
19		Michael Forbes, Neeraj Kayal, Rajat Mittal, Chandan Saha: Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant CoRR abs/1104.4557: (2011)
18		Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam: Reconstruction of Depth-4 Multilinear Circuits with Top fanin 2. Electronic Colloquium on Computational Complexity (ECCC) 18: 153 (2011)
17		Neeraj Kayal: Affine projections of polynomials. Electronic Colloquium on Computational Complexity (ECCC) 18: 61 (2011)
16		Xi Chen, Neeraj Kayal, Avi Wigderson: Partial Derivatives in Arithmetic Complexity and Beyond. Foundations and Trends in Theoretical Computer Science 6(1-2): 1-138 (2011)
	2010
15		Neeraj Kayal, Chandan Saha: On the Sum of Square Roots of Polynomials and related problems. Electronic Colloquium on Computational Complexity (ECCC) 17: 189 (2010)
14		Neeraj Kayal: Algorithms for Arithmetic Circuits. Electronic Colloquium on Computational Complexity (ECCC) 17: 73 (2010)
	2009
13		Neeraj Kayal, Shubhangi Saraf: Blackbox Polynomial Identity Testing for Depth 3 Circuits. FOCS 2009: 198-207
12		Neeraj Kayal, Timur Nezhmetdinov: Factoring Groups Efficiently. ICALP (1) 2009: 585-596
11		Neeraj Kayal: The Complexity of the Annihilating Polynomial. IEEE Conference on Computational Complexity 2009: 184-193
10		Neeraj Kayal, Shubhangi Saraf: Blackbox Polynomial Identity Testing for Depth 3 Circuits. Electronic Colloquium on Computational Complexity (ECCC) 16: 32 (2009)
	2008
9		Neeraj Kayal, Timur Nezhmetdinov: Factoring groups efficiently. Electronic Colloquium on Computational Complexity (ECCC) 15(074): (2008)
	2007
8		Neeraj Kayal, Nitin Saxena: Polynomial Identity Testing for Depth 3 Circuits. Computational Complexity 16(2): 115-138 (2007)
	2006
7		Neeraj Kayal, Nitin Saxena: Polynomial Identity Testing for Depth 3 Circuits. IEEE Conference on Computational Complexity 2006: 9-17
6		Neeraj Kayal, Nitin Saxena: Complexity of Ring Morphism Problems. Computational Complexity 15(4): 342-390 (2006)
	2005
5		Neeraj Kayal: Solvability of a System of Bivariate Polynomial Equations over a Finite Field. ICALP 2005: 551-562
4		Neeraj Kayal, Nitin Saxena: On the Ring Isomorphism and Automorphism Problems. IEEE Conference on Computational Complexity 2005: 2-12
3		Neeraj Kayal: Recognizing permutation functions in polynomial time. Electronic Colloquium on Computational Complexity (ECCC)(008): (2005)
2		Neeraj Kayal, Nitin Saxena: Polynomial Identity Testing for Depth 3 Circuits Electronic Colloquium on Computational Complexity (ECCC)(150): (2005)
	2004
1		Neeraj Kayal, Nitin Saxena: On the Ring Isomorphism & Automorphism Problems Electronic Colloquium on Computational Complexity (ECCC)(109): (2004)

Coauthor Index

1	Xi Chen	[16]
2	Michael Forbes	[19]
3	Ankit Gupta	[18] [22] [23] [25]
4	Satyanarayana V. Lokam	[18] [22] [25]
5	Rajat Mittal	[19]
6	Timur Nezhmetdinov	[9] [12]
7	Youming Qiao	[23]
8	Chandan Saha	[15] [19] [21]
9	Shubhangi Saraf	[10] [13]
10	Nitin Saxena	[1] [2] [4] [6] [7] [8]
11	Avi Wigderson	[16]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page