#8,900

Most Influential Person

Computer scientist

According to Wikipedia, Neeraj Kayal is an Indian computer scientist and mathematician noted for development of AKS primality test, along with Manindra Agrawal and Nitin Saxena. Kayal was born and raised in Guwahati, India.

- PRIMES is in P (989)
- Approaching the Chasm at Depth Four (113)
- Arithmetic Circuits: A Chasm at Depth Three (113)
- Polynomial Identity Testing for Depth 3 Circuits (102)
- Blackbox Polynomial Identity Testing for Depth 3 Circuits (92)
- An exponential lower bound for the sum of powers of bounded degree polynomials (85)
- A super-polynomial lower bound for regular arithmetic formulas (73)
- Partial Derivatives in Arithmetic Complexity and Beyond (67)
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (56)
- A branch and bound algorithm for solving the multiple-choice knapsack problem (46)
- Arithmetic Circuits: A Chasm at Depth 3 (41)
- Affine projections of polynomials: extended abstract (36)
- Efficient algorithms for some special cases of the polynomial equivalence problem (35)
- The Complexity of the Annihilating Polynomial (32)
- Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas (30)
- Reconstruction of depth-4 multilinear circuits with top fan-in 2 (26)
- Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits (25)
- Partial Derivatives in Arithmetic Complexity and Beyond (Foundations and Trends(R) in Theoretical Computer Science) (23)
- An almost Cubic Lower Bound for Depth Three Arithmetic Circuits (23)
- Complexity of Ring Morphism Problems (21)
- An exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin (20)
- Affine projections of polynomials (20)
- Lower Bounds for Depth-Three Arithmetic Circuits with small bottom fanin (19)
- On the ring isomorphism & automorphism problems (19)
- On the size of homogeneous and of depth four formulas with low individual degree (19)
- Factoring Groups Efficiently (17)
- Reconstruction of Full Rank Algebraic Branching Programs (16)
- A Selection of Lower Bounds for Arithmetic Circuits (16)
- Random arithmetic formulas can be reconstructed efficiently (15)
- Efficient Reconstruction of Random Multilinear Formulas (15)
- Lower Bounds for Sums of Powers of Low Degree Univariates (15)
- DERANDOMIZING SOME NUMBER-THEORETIC AND ALGEBRAIC ALGORITHMS. (14)
- Approaching the Chasm at Depth Four (13)
- Algorithms for Arithmetic Circuits (12)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (11)
- Reconstruction of non-degenerate homogeneous depth three circuits (10)
- Multi-k-ic Depth Three Circuit Lower Bound (9)
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (9)
- Polynomial Identity Testing for Depth 3 Circuits (9)
- Solvability of a System of Bivariate Polynomial Equations over a Finite Field (8)
- On the Sum of Square Roots of Polynomials and Related Problems (8)
- Towards a deterministic polynomial-time Primality Test (8)
- On the Sum of Square Roots of Polynomials and Related Problems (7)
- Lower Bounds for Sums of Products of Low arity Polynomials (7)
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree (7)
- PRIMES is in (7)
- Efficient algorithms for some special cases of the polynomial equivalence problem (5)
- Recognizing permutation functions in polynomial time (5)
- Multi-k-ic Depth Three Circuit Lower Bound (4)
- Lower Bounds for Depth Three Arithmetic Circuits with Small Bottom Fanin (4)
- Random Arithmetic Formulas Can Be Reconstructed Efficiently (4)
- Learning sums of powers of low-degree polynomials in the non-degenerate case (4)
- Determinant Equivalence Test over Finite Fields and over Q (4)
- Reconstruction of Full Rank Algebraic Branching Programs (2)
- Determinant equivalence test over finite fields and over $\mathbf{Q}$ (2)
- Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits (1)
- Arithmetic Circuit Complexity (Tutorial) (1)
- Derandomizing some algebraic and number-theoretic algorithms (1)
- Guest Column: A Paradigm for Arithmetic Circuit Lower Bounds (0)
- 18.703 Modern Algebra, A Quick Primality Test (0)
- PRIMES is in P Manindra (0)
- Math 788M: Computational Number Theory (0)
- Appendix A The complexity of CoeffSLP (0)
- Random Arithmetic Formulas can be Reconstructed Efficiently Full Version (0)
- Unexpected power of low-depth arithmetic circuits (0)
- Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant (0)
- Learning generalized depth-three arithmetic circuits in the non-degenerate case (0)
- n Generating Large Primes Using AKS (0)

This paper list is powered by the following services:

Neeraj Kayal is affiliated with the following schools:

This website uses cookies to enhance the user experience. Privacy Policy

Want to be an Academic Influence Insider?

Sign up to get the latest news, information, and rankings in our upcoming newsletter.