Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

JSAT
2006

favoriteEmaildiscussreport

68views more JSAT 2006»

Locality and Hard SAT-Instances

13 years 4 months ago

Locality and Hard SAT-Instances

Download abel.math.umu.se

In this note we construct a family of SAT-instance based on Eulerian graphs which are aimed at being hard for resolution based SAT-solvers. We discuss some experiments made with instances of this type and how a solver can try to avoid at least some of the pitfalls presented by these instances. Finally we look at how the density of subformulae can influence the hardness of SAT instances.

Klas Markström

Real-time Traffic

Eulerian Graphs | JSAT 2006 | Resolution Based Sat-solvers |

claim paper

Related Content

» Systematic vs Local Search for SAT

» Measuring the Hardness of SAT Instances

» Reducing hard SAT instances to polynomial ones

» Backbone Fragility and the Local Search Cost Peak

» Visualizing the Internal Structure of SAT Instances Preliminary Report

» Visualizing SAT Instances and Runs of the DPLL Algorithm

» Partitioning SAT Instances for Distributed Solving

» VariableSelection Heuristics in Local Search for SAT

» Understanding Random SAT Beyond the ClausestoVariables Ratio

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JSAT
Authors	Klas Markström

Comments (0)