On the complexity of 2-output Boolean networks
- 31 December 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 16 (2) , 177-185
- https://doi.org/10.1016/0304-3975(81)90074-8
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (MCS74-125197a, MCS77-0.2474)
- Massachusetts Institute of Technology
- Consiglio Nazionale delle Ricerche
This publication has 8 references indexed in Scilit:
- The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and MergingIEEE Transactions on Computers, 1979
- Relations Among Complexity MeasuresJournal of the ACM, 1979
- The complexity of monotone boolean functionsTheory of Computing Systems, 1977
- Realizing Boolean functions on disjoint sets of variablesTheoretical Computer Science, 1976
- The network complexity and the Turing machine complexity of finite functionsActa Informatica, 1976
- Practical decidabilityJournal of Computer and System Sciences, 1975
- The Power of Negative Thinking in Multiplying Boolean MatricesSIAM Journal on Computing, 1975
- Complexity of monotone networks for Boolean matrix productTheoretical Computer Science, 1975