On the combinational complexity of certain symmetric Boolean functions (Q4146674): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 21:43, 12 June 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
