Boolean functions whose monotone complexity is of size n2log n
Open Access
- 1 November 1982
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 21 (2) , 213-224
- https://doi.org/10.1016/0304-3975(89)90084-4
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A new lower bound on the monotone network complexity of Boolean sumsActa Informatica, 1980
- Some remarks on Boolean sumsActa Informatica, 1979
- The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and MergingIEEE Transactions on Computers, 1979
- Switching functions whose monotone complexity is nearly quadraticTheoretical Computer Science, 1979
- Complexity of Monotone Networks for Computing ConjunctionsPublished by Elsevier ,1978
- Shifting Graphs and Their ApplicationsJournal of the ACM, 1976
- Monotone switching circuits and boolean matrix productComputing, 1976
- The Power of Negative Thinking in Multiplying Boolean MatricesSIAM Journal on Computing, 1975
- Complexity of monotone networks for Boolean matrix productTheoretical Computer Science, 1975
- An Improved Lower Bound for Sorting NetworksIEEE Transactions on Computers, 1972