scientific article; zbMATH DE number 2019628

MaRDI QIDQ4440431zbMATH OpenFDO

Authors Ehud Friedgut, A. Wigderson, J. Kahn

Publication date 17 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2483/24830105.htm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Improved lower bounds on the randomized complexity of graph properties
• scientific article; zbMATH DE number 1754599
• 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

Cited in

(7)

• The complexity of subcube partition relates to the additive structure of the support
• Improved lower bounds on the randomized complexity of graph properties
• Separating decision tree complexity from subcube partition complexity
• The influence of random number generators on graph partitioning algorithms
• Irreducible subcube partitions
• Low-sensitivity functions from unambiguous certificates
• Sublinear Random Access Generators for Preferential Attachment Graphs

This page was built for publication:

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