Switching functions whose monotone complexity is nearly quadratic
Open Access
- 31 July 1979
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 9 (1) , 83-97
- https://doi.org/10.1016/0304-3975(79)90008-2
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The Power of Negative Thinking in Multiplying Boolean MatricesSIAM Journal on Computing, 1975
- Complexity of monotone networks for Boolean matrix productTheoretical Computer Science, 1975
- Gaussian elimination is not optimalNumerische Mathematik, 1969