scientific article

DOI10.4086/toc.2013.v009a019zbMath1366.68261OpenAlexW2406503277MaRDI QIDQ3191589

Elchanan Mossel, Dan Vilenchik, Uriel Feige

Publication date: 6 October 2014

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2013.v009a019

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

statistical physicsconstraint satisfactionSATaverage case

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Solving non-uniform planted and filtered random SAT formulas greedily

Cites Work

• Design of capacity-approaching irregular low-density parity-check codes
• The Decimation Process in Random $k$-SAT