Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
16
click to vote
COCO
2000
Springer
favorite
Email
discuss
report
100
views
Algorithms
»
more
COCO 2000
»
An Application of Matroid Theory to the SAT Problem
13 years 11 months ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision