Lower bounds to randomized algorithms for graph properties
- 30 June 1991
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 42 (3) , 267-287
- https://doi.org/10.1016/0022-0000(91)90003-n
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Lower bounds on probabilistic linear decision treesTheoretical Computer Science, 1985
- The complexity of problems on probabilistic, nondeterministic, and alternating decision treesJournal of the ACM, 1985
- On recognizing graph properties from adjacency matricesTheoretical Computer Science, 1976
- On the time required to recognize properties of graphsACM SIGACT News, 1973