The complexity of computing symmetric functions using threshold circuits (Q1193637)
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: The complexity of computing symmetric functions using threshold circuits |
scientific article; zbMATH DE number 64925
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of computing symmetric functions using threshold circuits |
scientific article; zbMATH DE number 64925 |
Statements
The complexity of computing symmetric functions using threshold circuits (English)
0 references
27 September 1992
0 references
size-depth tradeoffs
0 references
threshold circuits computing symmetric functions
0 references
number of connections
0 references
0 references
0.9305991
0 references
0.9157751
0 references
0.90958947
0 references
0.9088497
0 references
0.9062196
0 references
0.90560126
0 references
0.90186965
0 references
