scientific article; zbMATH DE number 1303602
From MaRDI portal
Publication:4250228
zbMath0930.68109MaRDI QIDQ4250228
Michael Krivelevich, Noga Alon, Benjamin Sudakov
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Optimal group testing, Energy landscape for large average submatrix detection problems in Gaussian random matrices, Random Instances of Problems in NP – Algorithms and Statistical Physics, A simple spectral algorithm for recovering planted partitions, New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory, Finding one community in a sparse graph, Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation, Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time, New bounds for the CLIQUE-GAP problem using graph decomposition theory, Notes on computational-to-statistical gaps: predictions using statistical physics, Finding large cliques in sparse semi-random graphs by simple randomized search heuristics, A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem, Submatrix localization via message passing, On the hardness of designing public signals, Exact recovery in the Ising blockmodel, Testing for high-dimensional geometry in random graphs, Computational barriers in minimax submatrix detection