On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7452427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of monotone circuits for threshold symmetric Boolean functions |
scientific article; zbMATH DE number 7452427 |
Statements
On the complexity of monotone circuits for threshold symmetric Boolean functions (English)
0 references
5 January 2022
0 references
monotone circuits
0 references
complexity
0 references
symmetric Boolean functions
0 references
threshold functions
0 references
0.855431854724884
0 references
0.8536359667778015
0 references
