Lower bounds to the complexity of symmetric Boolean functions
- 1 August 1990
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 74 (3) , 313-323
- https://doi.org/10.1016/0304-3975(90)90080-2
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- A lower bound on complexity of branching programsPublished by Springer Nature ,1984
- $\Omega (n\log n)$ Lower Bounds on Length of Boolean FormulasSIAM Journal on Computing, 1982