Lower bounds to randomized algorithms for graph properties

DOI10.1016/0022-0000(91)90003-NMaRDI QIDQ808708zbMATH OpenOpenAlexWikidataFDO

Authors Andrew Chi-Chih Yao

Publication date 1991

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(91)90003-n

zbMATH Keywords

randomized algorithmn-vertex graphsnontrivial monotone graph property

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties
• A lower bound for the complexity of monotone graph properties
• scientific article; zbMATH DE number 168429
• A lower bound for the recognition of digraph properties
• Improved lower bounds on the randomized complexity of graph properties

Cites work

• scientific article; zbMATH DE number 3558963 (Why is no real title available?)
• Lower bounds on probabilistic linear decision trees
• On recognizing graph properties from adjacency matrices
• The complexity of problems on probabilistic, nondeterministic, and alternating decision trees

Cited in

(4)

• Lower bounds for transition probabilities on graphs
• scientific article; zbMATH DE number 168429 (Why is no real title available?)
• Improved lower bounds on the randomized complexity of graph properties
• An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties

This page was built for publication: Lower bounds to randomized algorithms for graph properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808708)