3 citations · 7 across the 11 of their papers we have counts for
1 paper · 1 filter
V. Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polyn…