A class of boolean functions with linear combinational complexity
- 31 December 1975
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1 (2) , 161-183
- https://doi.org/10.1016/0304-3975(75)90018-3
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On the complexity of the marriage problemAdvances in Mathematics, 1972
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972
- The Synthesis of Two-Terminal Switching CircuitsBell System Technical Journal, 1949