| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6876244 | Theoretical Computer Science | 2014 | 13 Pages |
Abstract
We address the above problems on read-restricted arithmetic circuits and branching programs. We prove several complexity characterisations for the above problems on these restricted classes of arithmetic circuits.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Meena Mahajan, B.V. Raghavendra Rao, Karteek Sreenivasaiah,