Publication:3002778
From MaRDI portal
DOI10.4086/toc.2007.v003a002zbMath1213.68329MaRDI QIDQ3002778
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2007.v003a002
Related Items
Towards strong nonapproximability results in the Lovász-Schrijver hierarchy, Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT, Short propositional refutations for dense random 3CNF formulas, Noisy tensor completion via the sum-of-squares hierarchy, Note on strong refutation algorithms for random k-SAT formulas