Boolean circuits versus arithmetic circuits (Q2639101)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Boolean circuits versus arithmetic circuits |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Boolean circuits versus arithmetic circuits |
scientific article |
Statements
Boolean circuits versus arithmetic circuits (English)
0 references
1991
0 references
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.
0 references
Boolean circuits
0 references
arithmetic circuits
0 references
polynomials
0 references
finite fields
0 references
survey
0 references
