Neeraj Kayal

From MaRDI portal
Person:301525

Available identifiers

zbMath Open kayal.neerajDBLP07/4384WikidataQ3632411 ScholiaQ3632411MaRDI QIDQ301525

List of research outcomes





PublicationDate of PublicationType
Low-depth arithmetic circuit lower bounds: bypassing set-multilinearization2024-11-14Paper
Learning generalized depth three arithmetic circuits in the non-degenerate case2024-08-22Paper
Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth-three circuits2022-12-05Paper
Determinant Equivalence Test over Finite Fields and over Q2022-07-21Paper
Reconstruction of full rank algebraic branching programs2020-05-26Paper
Reconstruction of non-degenerate homogeneous depth three circuits2020-01-30Paper
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs2019-12-19Paper
Reconstruction of full rank algebraic branching programs2019-12-16Paper
On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree2019-01-31Paper
Erratum: ``PRIMES is in P2019-01-18Paper
Multi-\(k\)-ic depth three circuit lower bound2018-02-01Paper
Lower bounds for depth three arithmetic circuits with small bottom fanin2018-01-24Paper
Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth three circuits2018-01-24Paper
An almost cubic lower bound for depth three arithmetic circuits2017-12-19Paper
Efficient algorithms for some special cases of the polynomial equivalence problem2017-09-29Paper
On the size of homogeneous and of depth four formulas with low individual degree2017-09-29Paper
An exponential lower bound for homogeneous depth four arithmetic formulas2017-03-10Paper
Multi-\(k\)-ic depth three circuit lower bound2017-01-24Paper
A Selection of Lower Bounds for Arithmetic Circuits2016-09-22Paper
Arithmetic circuits: a chasm at depth 32016-07-04Paper
Lower bounds for depth-three arithmetic circuits with small bottom fanin2016-06-30Paper
Lower bounds for sums of powers of low degree univariates2015-10-27Paper
On the Sum of Square Roots of Polynomials and Related Problems2015-09-24Paper
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas2015-06-26Paper
A super-polynomial lower bound for regular arithmetic formulas2015-06-26Paper
Blackbox Polynomial Identity Testing for Depth 3 Circuits2014-07-25Paper
Affine projections of polynomials (extended abstract)2014-05-13Paper
Partial derivatives in arithmetic complexity and beyond2014-01-15Paper
Factoring Groups Efficiently2009-07-14Paper
Polynomial identity testing for depth 3 circuits2008-02-22Paper
Complexity of ring morphism problems2007-11-14Paper
Automata, Languages and Programming2006-01-10Paper
PRIMES is in P2005-04-18Paper

Research outcomes over time

This page was built for person: Neeraj Kayal