The structure of the set of satisfying assignments for a random \(k\)-CNF

DOI10.1007/S10598-008-9006-XzbMath1168.68041OpenAlexW2006682566MaRDI QIDQ2519391

F. Yu. Vorob'ev

Publication date: 26 January 2009

Published in: Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10598-008-9006-x

Mathematics Subject Classification ID

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

Cites Work

• Sharp thresholds of graph properties, and the $k$-sat problem
• The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
• Unnamed Item
• Unnamed Item

This page was built for publication: The structure of the set of satisfying assignments for a random \(k\)-CNF