2 papers
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…
cs.DS2021
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…