Upper bounds on the depth of symmetric Boolean functions (Q264012): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Igor S. Sergeev / rank | |||
| Property / author | |||
| Property / author: Igor S. Sergeev / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shallow circuits and concise formulae for multiple addition and multiplication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New upper bounds on the Boolean circuit complexity of symmetric functions / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3103/s0278641913040080 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027522969 / rank | |||
Normal rank | |||
Latest revision as of 11:13, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on the depth of symmetric Boolean functions |
scientific article |
Statements
Upper bounds on the depth of symmetric Boolean functions (English)
0 references
5 April 2016
0 references
depth
0 references
implementation
0 references
symmetric Boolean functions
0 references
Boolean circuits
0 references
multiplication
0 references
majority function
0 references
