Strong Refutation Heuristics for Random k-SAT

DOI10.1017/S096354830600784XzbMath1116.68081OpenAlexW2071318745MaRDI QIDQ3429738

Amin Coja-Oghlan, André Lanka, Andreas Goerdt

Publication date: 20 March 2007

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096354830600784x

zbMATH Keywords

satisfiabilitycertificate

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Noisy tensor completion via the sum-of-squares hierarchy ⋮ Note on strong refutation algorithms for random k-SAT formulas

This page was built for publication: Strong Refutation Heuristics for Random k-SAT