Bounds on Threshold of Regular Random k-SAT

DOI10.1007/978-3-642-14186-7_22zbMath1306.68174arXiv1002.1290OpenAlexW1651026641MaRDI QIDQ4930594

Vishwambhar Rathi, Lars Rasmussen, Mikael Skoglund, Erik Aurell

Publication date: 29 September 2010

Published in: Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.1290

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

The Number of Satisfying Assignments of Random Regulark-SAT Formulas ⋮ The asymptotic \(k\)-SAT threshold ⋮ Unnamed Item ⋮ Solving non-uniform planted and filtered random SAT formulas greedily

This page was built for publication: Bounds on Threshold of Regular Random k-SAT