The following pages link to Neeraj Kayal (Q301525):
Displaying 33 items.
- Lower bounds for depth-three arithmetic circuits with small bottom fanin (Q301527) (← links)
- Multi-\(k\)-ic depth three circuit lower bound (Q1694000) (← links)
- Erratum: ``PRIMES is in P'' (Q1711495) (← links)
- PRIMES is in P (Q1772458) (← links)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
- Complexity of ring morphism problems (Q2460031) (← links)
- Polynomial identity testing for depth 3 circuits (Q2472430) (← links)
- Arithmetic circuits: a chasm at depth 3 (Q2816300) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- Partial derivatives in arithmetic complexity and beyond (Q2872492) (← links)
- On the Sum of Square Roots of Polynomials and Related Problems (Q2947569) (← links)
- Multi-k-ic Depth Three Circuit Lower Bound (Q2955021) (← links)
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
- Lower Bounds for Sums of Powers of Low Degree Univariates (Q3448839) (← links)
- Factoring Groups Efficiently (Q3638065) (← links)
- (Q4598169) (← links)
- Lower bounds for depth three arithmetic circuits with small bottom fanin (Q4601827) (← links)
- Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits (Q4601898) (← links)
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree (Q4612480) (← links)
- Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits (Q5053054) (← links)
- Determinant Equivalence Test over Finite Fields and over Q (Q5091219) (← links)
- Reconstruction of Full Rank Algebraic Branching Programs (Q5111151) (← links)
- Blackbox Polynomial Identity Testing for Depth 3 Circuits (Q5171176) (← links)
- Reconstruction of Full Rank Algebraic Branching Programs (Q5205803) (← links)
- Reconstruction of non-degenerate homogeneous depth three circuits (Q5212782) (← links)
- Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas (Q5259545) (← links)
- A super-polynomial lower bound for regular arithmetic formulas (Q5259548) (← links)
- On the size of homogeneous and of depth four formulas with low individual degree (Q5361866) (← links)
- (Q5365127) (← links)
- Affine projections of polynomials (Q5415507) (← links)
- Automata, Languages and Programming (Q5716806) (← links)
- Learning generalized depth three arithmetic circuits in the non-degenerate case (Q6591871) (← links)
- Low-depth arithmetic circuit lower bounds: bypassing set-multilinearization (Q6638003) (← links)
