scientific article; zbMATH DE number 2243408
From MaRDI portal
Publication:5715725
zbMath1080.68653MaRDI QIDQ5715725
Haixia Jia, Moore, Cristopher, Demetrios Achlioptas
Publication date: 4 January 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden ⋮ On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability ⋮ Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning ⋮ Average-case analysis for the MAX-2SAT problem ⋮ Optimal testing for planted satisfiability problems ⋮ Random constraint satisfaction: easy generation of hard (satisfiable) instances ⋮ On the hardness of solving edge matching puzzles as SAT or CSP problems ⋮ Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length ⋮ Solving non-uniform planted and filtered random SAT formulas greedily
Uses Software
This page was built for publication:
