The critical complexity of all (monotone) boolean functions and monotone graph properties
- 31 December 1985
- journal article
- Published by Elsevier in Information and Control
- Vol. 67 (1-3) , 212-222
- https://doi.org/10.1016/s0019-9958(85)80036-x
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous WritesSIAM Journal on Computing, 1986
- The critical complexity of graph propertiesInformation Processing Letters, 1984