An arithmetic model of computation equivalent to threshold circuits (Q1186610)
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: An arithmetic model of computation equivalent to threshold circuits |
scientific article; zbMATH DE number 36849
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An arithmetic model of computation equivalent to threshold circuits |
scientific article; zbMATH DE number 36849 |
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
0 references
