Phase Transition for Local Search on Planted SAT
From MaRDI portal
Publication:2946386
DOI10.1007/978-3-662-48054-0_15zbMath1465.68232arXiv0811.2546OpenAlexW1638454426MaRDI QIDQ2946386
E. S. Skvortsov, Andrei A. Bulatov
Publication date: 16 September 2015
Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0811.2546
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas ⋮ Solving non-uniform planted and filtered random SAT formulas greedily