11 citations · 33 across the 22 of their papers we have counts for
Showing 2009 · cs.CCShow all
2 papers · 2 filters
cs.CC2009★ 11 cited
Deterministic Identity Testing of Read-Once Algebraic Branching Programs
Maurice Jansen, Youming Qiao, Jayalal Sarma
In this paper we study polynomial identity testing of sums of read-once algebraic branching programs (-RO-ABPs), generalizing the work in (Shpilka and Volkovich 2008,2009)…
cs.CC2009★ 5 cited
Balancing Bounded Treewidth Circuits
Maurice Jansen, Jayalal Sarma M. N
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size $…