Lower bounds for the size of expressions for certain functions in d-ary logic
- 31 December 1976
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 2 (2) , 249-269
- https://doi.org/10.1016/0304-3975(76)90035-9
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Combinatorial theory, 2nd edition, by Marshall Hall Jr. Pp. 440. £38.95. 1998. Wiley Classics Library. ISBN 0 471 31518 4 (Wiley).The Mathematical Gazette, 1999
- The Complexity of Finite FunctionsPublished by Elsevier ,1990
- Lower bounds on the size of Boolean formulasPublished by Association for Computing Machinery (ACM) ,1975
- On the complexity of the marriage problemAdvances in Mathematics, 1972
- PerceptronsThe American Journal of Psychology, 1971
- The Logical Complexity of Geometric Properties in the PlaneJournal of the ACM, 1970
- Lengths of Formulas and Elimination of Quantifiers IPublished by Elsevier ,1968