Publication:5715725
From MaRDI portal
zbMath1080.68653MaRDI QIDQ5715725
Haixia Jia, Moore, Cristopher, Demetrios Achlioptas
Publication date: 4 January 2006
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
On the Complexity of Random Satisfiability Problems with Planted Solutions, Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability, Average-case analysis for the MAX-2SAT problem, Random constraint satisfaction: easy generation of hard (satisfiable) instances, Solving non-uniform planted and filtered random SAT formulas greedily, Optimal testing for planted satisfiability problems, On the hardness of solving edge matching puzzles as SAT or CSP problems, Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning
Uses Software