We say that two given polynomials f, g ∈ R[X], over a ring R, are
equiva...
Recently, Forbes, Kumar and Saptharishi [CCC, 2016] proved that there ex...
Kayal, Saha and Tavenas [Theory of Computing, 2018] showed that for all ...
We study the size blow-up that is necessary to convert an algebraic circ...
In this paper, we study the algebraic formula complexity of multiplying ...