Boolean circuits versus arithmetic circuits

Joachim von zur Gathen, Gadiel Seroussi
<span title="">1991</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="" style="color: black;">Information and Computation</a> </i> &nbsp;
We compare the two computational models of Boolean circuits and arithmetic circuits in cases where they both apply, namely the computation of polynomials over the rational numbers or over finite fields. Over Q and finite fields, Boolean circuits can simulate arithmetic circuits efficiently with respect to size. Over finite lields of small characteristic, the two models are equally powerful when size is considered, but Boolean circuits are exponentially more powerful than arithmetic circuits
more &raquo; ... respect to depth. Most of the technical results given in this synopis are taken from the literature.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1016/0890-5401(91)90078-g</a> <a target="_blank" rel="external noopener" href="">fatcat:aydwnfiodfgy3bizzgauso2sei</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>