scientific article
From MaRDI portal
Publication:2762790
zbMath0981.68713MaRDI QIDQ2762790
Michael Krivelevich, Andreas Goerdt
Publication date: 9 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Noisy tensor completion via the sum-of-squares hierarchy ⋮ Spectral techniques applied to sparse random graphs ⋮ Short propositional refutations for dense random 3CNF formulas ⋮ Sherali-adams strikes back ⋮ Exact and approximative algorithms for coloring G(n,p) ⋮ The resolution complexity of random graph \(k\)-colorability ⋮ Typical case complexity of satisfiability algorithms and the threshold phenomenon ⋮ Recognizing more random unsatisfiable 3-SAT instances efficiently
This page was built for publication:
