A lower bound on the number of additions in monotone computations
- 1 September 1976
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 2 (3) , 305-315
- https://doi.org/10.1016/0304-3975(76)90083-9
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- The network complexity and the Turing machine complexity of finite functionsActa Informatica, 1976
- Complexity of monotone networks for Boolean matrix productTheoretical Computer Science, 1975