Note on strong refutation algorithms for random k-SAT formulas

DOI10.1016/j.endm.2009.11.027zbMath1268.68085OpenAlexW2080793500MaRDI QIDQ2840534

Hiệp Hàn, Mathias Schacht, Yury Person

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.027

Mathematics Subject Classification ID

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

Related Items (1)

On the Complexity of Random Satisfiability Problems with Planted Solutions

Cites Work

• An Efficient Sparse Regularity Concept
• Weak quasi-randomness for uniform hypergraphs
• Strong Refutation Heuristics for Random k-SAT
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on strong refutation algorithms for random k-SAT formulas