Neeraj Kayal - Citegraph

Author Info

Name	Affiliation	Papers
NEERAJ KAYAL	Microsoft Res Lab India, 196-36 2nd Main, Bangalore 560080, Karnataka, India	39
Collaborators	Citations	PageRank
22	263	19.39
Referers	Referees	References
155	238	417

Search Limit

100238

Publications (39 rows)

Collaborators (22 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits	5	0.42	2020
Learning sums of powers of low-degree polynomials in the non-degenerate case	1	0.35	2020
Determinant Equivalence Test over Finite Fields and over Q.	0	0.34	2019
Determinant equivalence test over finite fields and over $\mathbf{Q}$.	0	0.34	2019
Guest Column: A Paradigm for Arithmetic Circuit Lower Bounds.	0	0.34	2018
Average-case linear matrix factorization and reconstruction of low width Algebraic Branching Programs.	0	0.34	2018
Reconstruction of non-degenerate homogeneous depth three circuits.	1	0.35	2018
Unexpected power of low-depth arithmetic circuits.	0	0.34	2017
Reconstruction of full rank Algebraic Branching Programs.	0	0.34	2017
On the size of homogeneous and of depth four formulas with low individual degree.	2	0.38	2016
An almost Cubic Lower Bound for Depth Three Arithmetic Circuits.	0	0.34	2016
Arithmetic Circuits: A Chasm at Depth 3.	0	0.34	2016
Multi-k-ic Depth Three Circuit Lower Bound.	1	0.35	2015
Lower Bounds for Sums of Products of Low arity Polynomials.	1	0.36	2015
Lower Bounds for Sums of Powers of Low Degree Univariates.	5	0.53	2015
Lower Bounds for Depth Three Arithmetic Circuits with small bottom fanin.	4	0.41	2015
Arithmetic Circuit Complexity (Tutorial).	1	0.35	2014
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas	21	0.75	2014
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas	9	0.54	2014
Arithmetic Circuits: A Chasm at Depth Three	47	1.29	2013
A super-polynomial lower bound for regular arithmetic formulas	27	1.03	2013
On the Sum of Square Roots of Polynomials and Related Problems	6	0.44	2012
An exponential lower bound for the sum of powers of bounded degree polynomials.	29	1.16	2012
Reconstruction of depth-4 multilinear circuits with top fan-in 2	3	0.40	2012
An exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin.	4	0.43	2012
Affine projections of polynomials: extended abstract	6	0.45	2012
Partial Derivatives in Arithmetic Complexity and Beyond	17	0.88	2011
Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant	0	0.34	2011
Affine projections of polynomials	2	0.35	2011
Efficient Reconstruction of Random Multilinear Formulas	3	0.38	2011
Efficient algorithms for some special cases of the polynomial equivalence problem	3	0.38	2011
Algorithms for Arithmetic Circuits	5	0.40	2010
The Complexity of the Annihilating Polynomial	9	0.61	2009
Blackbox Polynomial Identity Testing for Depth 3 Circuits	42	1.25	2009
Factoring groups efficiently	1	0.39	2008
Complexity of Ring Morphism Problems	3	0.46	2006
Solvability of a system of bivariate polynomial equations over a finite field	2	0.40	2005
Recognizing permutation functions in polynomial time	0	0.34	2005
On the Ring Isomorphism and Automorphism Problems	3	0.51	2004