Prashanth Amireddy

TL;DR: In this paper , the authors proved super-polynomial lower bounds for low-depth arithmetic circuits using the shifted partials measure and affine projections of partials, and defined a subclass of homogeneous formulas which they called unique parse tree (UPT) formulas.

TL;DR: This paper begins study of the computational power of adaptive and non-adaptive monotone decision trees - decision trees where each query is amonotone function on the input bits and proves the following characterizations and bounds.

TL;DR: In this article, a dynamic programming solution to find the minimum cost of a diameter constrained Steiner tree in case of directed graphs is given, and a simple reduction from undirected version to the directed version to realize an algorithm of similar complexity is presented.

TL;DR: This paper studies the effect of interdependency of negation gates in circuits in terms of computational power and shows the power of independent negations in circuits.

TL;DR: In this paper , the authors studied the testability of low-constant degree functions from a product domain to a field where the sets can be arbitrary constant sized sets, and showed that these functions are locally testable when the grid is asymmetric.