On the combinational complexity of certain symmetric Boolean functions (Q4146674): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: A class of Boolean functions with linear combinational complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds to Complexities of Networks for Sorting and for Switching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational Work and Time on Finite Machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The combinational complexity of equivalence / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01683282 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989734466 / rank | |||
Normal rank | |||
Latest revision as of 10:32, 30 July 2024
scientific article; zbMATH DE number 3577152
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the combinational complexity of certain symmetric Boolean functions |
scientific article; zbMATH DE number 3577152 |
Statements
On the combinational complexity of certain symmetric Boolean functions (English)
0 references
1977
0 references
