1.1. Non-commutative computation. Arithmetic complexity theory studies the computation of formal polynomials over some field or ring. Most of this theory is concerned with the computation of commutative polynomials. The basic model of computation is that of an arithmetic circuit. Despite decades of work, the bes
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.