activity
20082026
most citedDeterministic Identity Testing of Read-Once Algebraic Branching Programs

11 citations · 33 across the 22 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

cs.CC2013

Arithmetic Circuit Lower Bounds via MaxRank

Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma M. N

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our…

cs.CC2013

Pebbling, Entropy and Branching Program Size Lower Bounds

Balagopal Komarath, Jayalal Sarma M. N

We contribute to the program of proving lower bounds on the size of branching programs solving the Tree Evaluation Problem introduced by Cook et. al. (2012). Proving a super-polyno…