1 citations · 1 across the 2 of their papers we have counts for
4 papers
Limitations of Sums of Bounded-Read Formulas
Purnata Ghosal, B. V. Raghavendra Rao
Proving super polynomial size lower bounds for various classes of arithmetic circuits computing explicit polynomials is a very important and challenging task in algebraic complexit…
Lower bounds for multilinear bounded order ABPs
C. Ramya, B. V. Raghavendra Rao
Proving super-polynomial size lower bounds for syntactic multilinear Algebraic Branching Programs(smABPs) computing an explicit polynomial is a challenging problem in Algebraic Com…
Lower Bounds for Special Cases of Syntactic Multilinear ABPs
C. Ramya, B. V. Raghavendra Rao
Algebraic Branching Programs(ABPs) are standard models for computing polynomials. Syntactic multilinear ABPs (smABPs) are restrictions of ABPs where every variable is allowed to oc…
Linear Projections of the Vandermonde Polynomial
C. Ramya, B. V. Raghavendra Rao
An n-variate Vandermonde polynomial is the determinant of the n x n matrix where the ith column is the vector (1, x_i, x_i^2, ...., x_i^{n-1})^T. Vandermonde polynomials play a cru…