Skip to search formSkip to main contentSkip to account menu

Neeraj Kayal

Known as: Kayal 
Neeraj Kayal (Hindi: नीरज कयाल) is an Indian computer scientist. Kayal was born and raised in Guwahati, India. Kayal graduated with a B.Tech from the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
AKS primality testBPP (complexity)Computational complexity theoryComputer scientist

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits
We study the size blow-up that is necessary to convert an algebraic circuit of product-depth δ+1 to one of product-depth δ in the… 
Highly Cited
2017
Highly Cited
2017
Digital Commons@Becker Digital Commons@Becker Classification of traumatic brain injury for targeted therapies Classification of traumatic brain injury for targeted therapies Classification of…
The heterogeneity of traumatic brain injury (TBI) is considered one of the most significant barriers to finding effective… 
2016
2016
PSF: Introduction to R Package for Pattern Sequence Based Forecasting Algorithm
This paper discusses about an R package that implements the Pattern Sequence based Forecasting (PSF) algorithm, which was… 
2015
2015
Finding Robust Assailant Using Optimization Functions (FiRAO-PG) in Wireless Sensor Network
Wireless sensor network consists of hundreds or thousands of low cost, low power, and self-organizing tiny sensor nodes that are… 
2015
2015
Deterministic Divisibility Testing via Shifted Partial Derivatives
Kayal has recently introduced the method of shifted partial derivatives as a way to give the first exponential lower bound for… 
2013
2013
The limits of depth reduction for arithmetic formulas: it's all about the top fan-in
In recent years, a very exciting and promising method for proving lower bounds for arithmetic circuits has been proposed. This… 
2013
2013
Solving the Problem of New Uses
One of the most dramatic public-policy failures in biomedical research is the lack of incentives for industry to develop new… 
2013
2013
Unifying Known Lower Bounds via Geometric Complexity Theory
We show that most algebraic circuit lower bounds and relations between lower bounds naturally fit into the representation… 
2012
2012
Photodynamic Therapy: A View through Light
The removal of biofilm and mineralized deposits from the tooth surface are the fundamental aspects of periodontal therapy. Using… 
Highly Cited
2008
Highly Cited
2008
The Complexity Challenge in Embedded System Design
The ever-increasing functionality and the nonfunctional constraints that must be satisfied by embedded systems lead to an… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)