5 papers
Local Correction of Linear Functions over the Boolean Cube
Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar +2
We consider the task of locally correcting, and locally list-correcting, multivariate linear functions over the domain over arbitrary fields and more generally Abelian…
Low-Degree Testing Over Grids
Prashanth Amireddy, Srikanth Srinivasan, Madhu Sudan
We study the question of local testability of low (constant) degree functions from a product domain to a field , where ${S_i} \subseteq…
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…
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…
Diameter constrained Steiner tree and related problems
Prashanth Amireddy, Chetan Sai Digumarthi
We give a dynamic programming solution to find the minimum cost of a diameter constrained Steiner tree in case of directed graphs. Then we show a simple reduction from undirected v…