The circuit depth of symmetric boolean functions
- 31 August 1978
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 17 (1) , 108-115
- https://doi.org/10.1016/0022-0000(78)90038-7
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Method of determining lower bounds for the complexity of P-schemesMathematical Notes, 1971
- Lengths of Formulas and Elimination of Quantifiers IPublished by Elsevier ,1968