Boolean circuits versus arithmetic circuits
The authors compare the two computational models of Boolean circuits and arithmetic circuits for the computation of polynomials over the rationals and over finite fields. In the case of finite fields separate treatments are given for the cases of large and small characteristics. As the goal of the paper is to survey the literature and to compare the effectiveness of these two models of computations, few proofs are given.
scientific article