Entropy of contact circuits and lower bounds on their complexity
- 30 April 1988
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 57 (1), 113-129
- https://doi.org/10.1016/0304-3975(88)90166-1
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The monotone circuit complexity of boolean functionsCombinatorica, 1987
- Bounds for Width Two Branching ProgramsSIAM Journal on Computing, 1986
- Boolean functions whose monotone complexity is of sizeTheoretical Computer Science, 1982