2 citations · 4 across the 5 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2015
Limitations of sum of products of Read-Once Polynomials
C. Ramya, B. V. Raghavendra Rao
We study limitations of polynomials computed by depth two circuits built over read-once polynomials (ROPs) and depth three syntactically multi-linear formulas. We prove an exponent…
cs.CC2014★ 1 cited
Parameterized Analogues of Probabilistic Computation
Ankit Chauhan, B. V. Raghavendra Rao
We study structural aspects of randomized parameterized computation. We introduce a new class - as a natural parameterized analogue of . Our defin…
cs.CC2014★ 1 cited
New Algorithms and Hard Instances for Non-Commutative Computation
Christian Engels, B. V. Raghavendra Rao
Motivated by the recent developments on the complexity of non-com\-mu\-ta\-tive determinant and permanent [Chien et al.\ STOC 2011, Bläser ICALP 2013, Gentry CCC 2014] we attempt a…