Random 2-SAT with prescribed literal degrees

DOI10.1007/s00453-007-0082-7zbMath1121.68105OpenAlexW2004411866WikidataQ57401494 ScholiaQ57401494MaRDI QIDQ2642316

Gregory B. Sorkin, Colin Cooper, Alan M. Frieze

Publication date: 20 August 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-0082-7

zbMATH Keywords

phase transitions

Mathematics Subject Classification ID

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

Related Items (7)

The impact of heterogeneity and geometry on the proof complexity of random satisfiability ⋮ The number of satisfying assignments of random 2‐SAT formulas ⋮ Biased random k‐SAT ⋮ Satisfiability threshold for power law random 2-SAT in configuration model ⋮ Popularity-similarity random SAT formulas ⋮ Branching Process Approach for 2-Sat Thresholds ⋮ Unnamed Item

This page was built for publication: Random 2-SAT with prescribed literal degrees