Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\)

zbMath1163.68337MaRDI QIDQ1010652

Amin Coja-Oghlan, Alan M. Frieze

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130036

Mathematics Subject Classification ID

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

Related Items (2)

Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases ⋮ The condensation transition in random hypergraph 2-coloring

This page was built for publication: Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\)