Compositional complexity of Boolean functions
- 31 January 1982
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 4 (1), 1-10
- https://doi.org/10.1016/0166-218x(82)90029-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Towards a theory of local and global in computationTheoretical Computer Science, 1978
- 6096The American Mathematical Monthly, 1978
- The network complexity and the Turing machine complexity of finite functionsActa Informatica, 1976
- Practical decidabilityJournal of Computer and System Sciences, 1975
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972
- On boolean functions and connected setsTheory of Computing Systems, 1971