An arithmetic model of computation equivalent to threshold circuits (Q1186610): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:12, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An arithmetic model of computation equivalent to threshold circuits |
scientific article |
Statements
An arithmetic model of computation equivalent to threshold circuits (English)
0 references
28 June 1992
0 references
arbitrary fan-in Boolean circuit complexity
0 references
circuits
0 references
fan-in arithmetic gates
0 references
characteristic-two finite fields
0 references
arithmetic model
0 references
Boolean threshold computations
0 references
