The critical complexity of graph properties
- 30 March 1984
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 18 (3) , 151-153
- https://doi.org/10.1016/0020-0190(84)90019-x
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- A tight Ω(loglog n)-bound on the time for parallel Ram's to compute nondegenerated boolean functionsPublished by Springer Nature ,1983
- On recognizing graph properties from adjacency matricesTheoretical Computer Science, 1976