A measure in which Boolean negation is exponentially powerful
- 5 October 1983
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 17 (3), 125-128
- https://doi.org/10.1016/0020-0190(83)90051-0
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- The complexity of monotone boolean functionsTheory of Computing Systems, 1977