Lower bounds to randomized algorithms for graph properties

DOI10.1016/0022-0000(91)90003-NzbMATH Open0732.68058OpenAlexW2146111707WikidataQ56701669 ScholiaQ56701669MaRDI QIDQ808708FDOQ808708

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

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

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)

Cites Work

• On recognizing graph properties from adjacency matrices
• Lower bounds on probabilistic linear decision trees
• The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
• Title not available (Why is that?)

Cited In (4)

• Improved lower bounds on the randomized complexity of graph properties
• Title not available (Why is that?)
• An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties
• Lower bounds for transition probabilities on graphs

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)