Computing majority by constant depth majority circuits with low fan-in gates (Q4636650)
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: Computing majority by constant depth majority circuits with low fan-in gates |
scientific article; zbMATH DE number 6862141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing majority by constant depth majority circuits with low fan-in gates |
scientific article; zbMATH DE number 6862141 |
Statements
19 April 2018
0 references
circuit complexity
0 references
computational complexity
0 references
threshold
0 references
majority
0 references
lower bound
0 references
upper bound
0 references
Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates (English)
0 references
0.9939559698104858
0 references
0.8579514622688293
0 references
0.8390828371047974
0 references
0.8370741605758667
0 references
0.8325496912002563
0 references
