Showing 2022Show all
2 papers · 1 filter
cs.CC2022
Power of Decision Trees with Monotone Queries
Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma
In this paper, we initiate study of the computational power of adaptive and non-adaptive monotone decision trees - decision trees where each query is a monotone function on the inp…
cs.CC2022
Low-depth arithmetic circuit lower bounds via shifted partials
Prashanth Amireddy, Ankit Garg, Neeraj Kayal +2
We prove super-polynomial lower bounds for low-depth arithmetic circuits using the shifted partials measure [Gupta-Kamath-Kayal-Saptharishi, CCC 2013], [Kayal, ECCC 2012] and the a…