The complexity of negation-limited networks — A brief survey
- 1 January 1975
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The combinational complexity of equivalenceTheoretical Computer Science, 1976
- Complexity of monotone networks for Boolean matrix productTheoretical 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
- Combinational complexity of some monotone functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- The power of negative thinking in multiplying Boolean matricesPublished by Association for Computing Machinery (ACM) ,1974
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972
- Minimal Negative Gate NetworksIEEE Transactions on Computers, 1972
- Boolean matrix multiplication and transitive closurePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971
- On the Inversion Complexity of a System of FunctionsJournal of the ACM, 1958