Sciweavers

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

105

COCO
2000
Springer

100views Algorithms» more COCO 2000»

An Application of Matroid Theory to the SAT Problem

15 years 6 months ago

An Application of Matroid Theory to the SAT Problem

Download www.cs.swan.ac.uk

Oliver Kullmann

Real-time Traffic

Algorithms | COCO 2000 |

claim paper

Related Content

» Matching Problems in Polymatroids Without Double Circuits

» A WriteBased Solver for SAT Modulo the Theory of Arrays

» From KSAT to Delayed Theory Combination Exploiting DPLL Outside the SAT Domain

» Satisfiability Modulo the Theory of Costs Foundations and Applications

» The state of SAT

» From query complexity to computational complexity

» Finding Rough Set Reducts with SAT

» Efficient SAT solving beyond supercubes

» Solving MAXrSAT Above a Tight Lower Bound

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2000
Where	COCO
Authors	Oliver Kullmann

Comments (0)