scientific article; zbMATH DE number 2019628
From MaRDI portal
Publication:4440431
zbMath1028.68567MaRDI QIDQ4440431
Avi Wigderson, Ehud Friedgut, Jeffry Kahn
Publication date: 17 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2483/24830105.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (3)
Low-Sensitivity Functions from Unambiguous Certificates. ⋮ Irreducible subcube partitions ⋮ Improved lower bounds on the randomized complexity of graph properties
This page was built for publication:
