Neeraj Kayal - Concepedia

Author

Neeraj Kayal

Microsoft Research (India)

Also Known As

Kayal, Neeraj, Kumar, Mrinal, Mrinal Kumar, N. Kayal, Neeraj Kayal

Publications

1.7K

Citations

H-Index

Concepts

All Affiliations

Microsoft Research (India)Microsoft (United States)Indian Institute of Science Bangalore National University of Singapore Microsoft Research (United Kingdom)

About

Neeraj Kayal is an author at Microsoft Research (India) specializing in engineering, computational complexity, and computer science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	15	20	1.5K
2	Computer Science	12	15	1.4K
3	Humanities	2	2	92
4	Computer Engineering	2	2	87
5	Natural Sciences	1	1	14

Neeraj Kayal

Publications

1.6K

Citations

H-Index

Page 1

	Year	Citations
PRIMES is in P Manindra Agrawal, Neeraj Kayal, Nitin Saxena Annals of Mathematics Theory Of ComputingComputational Complexity TheoryEngineeringComputational Number TheoryVerification	2004	908
Arithmetic Circuits: A Chasm at Depth Three Ankit Gupta, Pritish Kamath, Neeraj Kayal, Circuit ComplexityTheory Of ComputingComputational Complexity TheoryEngineeringComputational Number Theory	2013	80
Blackbox Polynomial Identity Testing for Depth 3 Circuits Neeraj Kayal, Shubhangi Saraf Circuit ComplexityEngineeringVerificationDepth 3Computational Complexity	2009	73
An exponential lower bound for the sum of powers of bounded degree polynomials. Neeraj Kayal Electronic colloquium on computational complexity EngineeringOrthogonal PolynomialAlgebraic ComplexityExponential Lower BoundAnalytic Number Theory	2012	60
A super-polynomial lower bound for regular arithmetic formulas Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi Circuit ComplexityComputational Complexity TheoryEngineeringComputational ComplexityFixed Layer	2014	56
Approaching the Chasm at Depth Four Ankit Gupta, Pritish Kamath, Neeraj Kayal, Theory Of ComputingCircuit ComplexityHomogeneous Depth FourHumanitiesEngineering	2013	48
Approaching the Chasm at Depth Four Ankit Gupta, Pritish Kamath, Neeraj Kayal, Journal of the ACM Theory Of ComputingCircuit ComplexityHomogeneous Depth FourHumanitiesEngineering	2014	44
A branch and bound algorithm for solving the multiple-choice knapsack problem Martin Dyer, Neeraj Kayal, James S. Walker Journal of Computational and Applied Mathematics Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringComputational ComplexityBranch And Cut	1984	43
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas Neeraj Kayal, Nutan Limaye, Chandan Saha, Theory Of ComputingHomogeneous Depth FourGeometry Of NumberComputational Complexity TheoryEngineering	2014	38
Arithmetic Circuits: A Chasm at Depth 3 Ankit Gupta, Pritish Kamath, Neeraj Kayal, SIAM Journal on Computing Circuit Complexity\Mathbb QEngineeringComputational Complexity TheoryComputational Number Theory	2016	35

Page 1