On the combinational complexity of certain symmetric Boolean functions
- 1 December 1976
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 10 (1) , 323-336
- https://doi.org/10.1007/bf01683282
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The combinational complexity of equivalenceTheoretical Computer Science, 1976
- A class of boolean functions with linear combinational complexityTheoretical Computer Science, 1975
- Bounds to Complexities of Networks for Sorting and for SwitchingJournal of the ACM, 1975
- A 2.5 n-lower bound on the combinational complexity of Boolean functionsPublished by Association for Computing Machinery (ACM) ,1975
- Zwei lineare untere Schranken für die Komplexität Boolescher FunktionenComputing, 1974
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972