On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:06, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of monotone circuits for threshold symmetric Boolean functions |
scientific article |
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
