Lower bounds for depth-restricted branching programs
- 1 March 1991
- journal article
- Published by Elsevier in Information and Computation
- Vol. 91 (1) , 1-14
- https://doi.org/10.1016/0890-5401(91)90072-a
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The monotone circuit complexity of boolean functionsCombinatorica, 1987
- A Boolean function requiring 3n network sizeTheoretical Computer Science, 1983
- A $2.5n$-Lower Bound on the Combinational Complexity of Boolean FunctionsSIAM Journal on Computing, 1977