Boolean circuits versus arithmetic circuits (Q2639101): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q234387 |
||
| Property / reviewed by | |||
| Property / reviewed by: Gary L. Mullen / rank | |||
Revision as of 08:34, 11 February 2024
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
