| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ankit Gupta, Neeraj Kayal, Youming Qiao |
Random Arithmetic Formulas can be Reconstructed Efficiently.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Neeraj Kayal |
Affine projections of polynomials: extended abstract. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam |
Reconstruction of depth-4 multilinear circuits with top fan-in 2. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam |
Reconstruction of Depth-4 Multilinear Circuits with Top fanin 2. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Neeraj Kayal |
Affine projections of polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Xi Chen, Neeraj Kayal, Avi Wigderson |
Partial Derivatives in Arithmetic Complexity and Beyond. |
Foundations and Trends in Theoretical Computer Science |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Forbes, Neeraj Kayal, Rajat Mittal, Chandan Saha |
Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Neeraj Kayal |
Efficient algorithms for some special cases of the polynomial equivalence problem. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam |
Efficient Reconstruction of Random Multilinear Formulas. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeraj Kayal, Chandan Saha |
On the Sum of Square Roots of Polynomials and Related Problems. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeraj Kayal |
Algorithms for Arithmetic Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Neeraj Kayal, Chandan Saha |
On the Sum of Square Roots of Polynomials and related problems. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Neeraj Kayal, Shubhangi Saraf |
Blackbox Polynomial Identity Testing for Depth 3 Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Neeraj Kayal, Timur Nezhmetdinov |
Factoring Groups Efficiently. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeraj Kayal, Shubhangi Saraf |
Blackbox Polynomial Identity Testing for Depth 3 Circuits. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Sylvester, Derandomization, Arithmetic circuits |
| 1 | Neeraj Kayal |
The Complexity of the Annihilating Polynomial. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeraj Kayal, Timur Nezhmetdinov |
Factoring groups efficiently. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Neeraj Kayal, Nitin Saxena |
Polynomial Identity Testing for Depth 3 Circuits. |
Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
13P99, Subject classification. 68Q15 |
| 1 | Neeraj Kayal, Nitin Saxena |
Complexity of Ring Morphism Problems. |
Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
13P99, Subject classification. 68Q15 |
| 1 | Neeraj Kayal, Nitin Saxena |
Polynomial Identity Testing for Depth 3 Circuits. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeraj Kayal, Nitin Saxena |
Polynomial Identity Testing for Depth 3 Circuits |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Neeraj Kayal |
Recognizing permutation functions in polynomial time. |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Neeraj Kayal |
Solvability of a System of Bivariate Polynomial Equations over a Finite Field. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeraj Kayal, Nitin Saxena |
On the Ring Isomorphism and Automorphism Problems. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeraj Kayal, Nitin Saxena |
On the Ring Isomorphism & Automorphism Problems |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")