Satisfiability threshold for power law random 2-SAT in configuration model

DOI10.1007/978-3-030-24258-9_4zbMath1441.68234arXiv1905.04827OpenAlexW2953416456MaRDI QIDQ5918829

Oleksii Omelchenko, Andrei A. Bulatov

Publication date: 20 May 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

phase transitionsatisfiabilitypower law

Mathematics Subject Classification ID

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

Related Items (2)

Popularity-similarity random SAT formulas ⋮ Solving non-uniform planted and filtered random SAT formulas greedily

This page was built for publication: Satisfiability threshold for power law random 2-SAT in configuration model