The effect of null-chains on the complexity of contact schemes
- 1 January 1989
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 246-256
- https://doi.org/10.1007/3-540-51498-8_24
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Entropy of contact circuits and lower bounds on their complexityTheoretical Computer Science, 1988
- The gap between monotone and non-monotone circuit complexity is exponentialCombinatorica, 1988
- Two lower bounds for circuits over the basis (&, V, -)Published by Springer Nature ,1988
- The complexity of symmetric boolean functionsLecture Notes in Computer Science, 1987
- Lower bounds on the complexity of local circuitsPublished by Springer Nature ,1986