Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Neeraj Kayal
Observed names:
Kayal, Neeraj,
N. Kayal
Institutions:
Microsoft (United States),
Microsoft Research (India)
Observed institutions:
Microsoft (United States),
National University of Singapore,
Institute for Advanced Study,
Microsoft Research (India),
Indian Institute of Science Bangalore,
Indian Institute of Technology Kanpur
show all 6
ORCID:
0009-0002-0036-7702
Observed ORCID:
0009-0002-0036-7702
OpenAlex ID:
A5079701530
PRIMES is in P
2004
·
Manindra Agrawal
, Neeraj Kayal
, et al.
·
Annals of Mathematics
·
1,342
PDF
Polynomial Identity Testing for Depth 3 Circuits
2006
·
Neeraj Kayal
, Nitin Saxena
·
Computational Complexity
·
118
PDF
Blackbox Polynomial Identity Testing for Depth 3 Circuits
2009
·
Neeraj Kayal
, Shubhangi Saraf
·
Annual Symposium on Foundations of Computer Science
·
110
Arithmetic Circuits: A Chasm at Depth Three
2013
·
Ankit Gupta
, Pritish Kamath
, et al.
·
Annual Symposium on Foundations of Computer Science
·
104
An exponential lower bound for the sum of powers of bounded degree polynomials.
2012
·
Neeraj Kayal
·
Electronic colloquium on computational complexity
·
86
A super-polynomial lower bound for regular arithmetic formulas
2014
·
Neeraj Kayal
, Chandan Saha
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
84
Efficient algorithms for some special cases of the polynomial equivalence problem
2011
·
Neeraj Kayal
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
71
Arithmetic Circuits: A Chasm at Depth 3
2016
·
Ankit Gupta
, Pritish Kamath
, et al.
·
SIAM Journal on Computing
·
68
Approaching the Chasm at Depth Four
2014
·
Ankit Gupta
, Pritish Kamath
, et al.
·
Journal of the ACM
·
68
Affine projections of polynomials: extended abstract
2012
·
Neeraj Kayal
·
ACM Symposium on Theory of Computing (STOC)
·
63
Approaching the Chasm at Depth Four
2013
·
Ankit Gupta
, Pritish Kamath
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
62
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
2014
·
Neeraj Kayal
, Nutan Limaye
, et al.
·
Annual Symposium on Foundations of Computer Science
·
45
The Complexity of the Annihilating Polynomial
2009
·
Neeraj Kayal
·
IEEE Conference on Computational Complexity (CCC)
·
44
Learning sums of powers of low-degree polynomials in the non-degenerate case
2020
·
Ankit Garg
, Neeraj Kayal
, et al.
·
Annual Symposium on Foundations of Computer Science
·
38
PDF
Reconstruction of depth-4 multilinear circuits with top fan-in 2
2012
·
Ankit Gupta
, Neeraj Kayal
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
37
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits
2020
·
Neeraj Kayal
, Vineet Nair
, et al.
·
ACM Transactions on Computation Theory
·
36
PDF
Factoring Groups Efficiently
2009
·
Neeraj Kayal
, Timur Nezhmetdinov
·
Lecture notes in computer science
·
36
Complexity of Ring Morphism Problems
2006
·
Neeraj Kayal
, Nitin Saxena
·
Computational Complexity
·
30
PDF
Reconstruction of non-degenerate homogeneous depth three circuits
2019
·
Neeraj Kayal
, Chandan Saha
·
ACM Symposium on Theory of Computing (STOC)
·
28
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
2017
·
Neeraj Kayal
, Nutan Limaye
, et al.
·
SIAM Journal on Computing
·
28
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
2014
·
Neeraj Kayal
, Nutan Limaye
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
28
On the Sum of Square Roots of Polynomials and Related Problems
2011
·
Neeraj Kayal
, Chandan Saha
·
ACM Transactions on Computation Theory
·
23
Efficient Reconstruction of Random Multilinear Formulas
2011
·
Ankit Gupta
, Neeraj Kayal
, et al.
·
Annual Symposium on Foundations of Computer Science
·
22
On the Ring Isomorphism and Automorphism Problems
2005
·
N. Kayal
, N. Saxena
·
IEEE Conference on Computational Complexity (CCC)
·
22
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
2019
·
Neeraj Kayal
, Vineet Nair
, et al.
·
Computational Complexity
·
21
Show more works
View as search
Works count:
76
Citation count:
2,930
H-index:
22
I10-index:
42
Year
Topic
Type