On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1515/dma-2021-0031 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3207053979 / rank | |||
Normal rank | |||
Revision as of 03:23, 20 March 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
