Models for Random Constraint Satisfaction Problems
From MaRDI portal
Publication:4706240
DOI10.1137/S0097539700368667zbMath1029.68118MaRDI QIDQ4706240
No author found.
Publication date: 19 June 2003
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Related Items (13)
Many hard examples in exact phase transitions ⋮ Satisfiability Thresholds beyond k −XORSAT ⋮ An algorithm for random signed 3-SAT with intervals ⋮ Combinatorial sharpness criterion and phase transition classification for random CSPs ⋮ The scaling window of the model \(d\)-\(k\)-CSP ⋮ Percolation on fitness landscapes: effects of correlation, phenotype, and incompatibilities ⋮ The SAT-UNSAT transition for random constraint satisfaction problems ⋮ Random constraint satisfaction: easy generation of hard (satisfiable) instances ⋮ Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT ⋮ Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains ⋮ When does the giant component bring unsatisfiability? ⋮ Streamlining variational inference for constraint satisfaction problems ⋮ A sharp threshold for the renameable-Horn and the \(q\)-Horn properties
This page was built for publication: Models for Random Constraint Satisfaction Problems