Sciweavers

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

46

Voted

CORR
2010
Springer

56views Education» more CORR 2010»

Better algorithms for satisfiability problems for formulas of bounded rank-width

15 years 2 months ago

Better algorithms for satisfiability problems for formulas of bounded rank-width

Download drops.dagstuhl.de

Robert Ganian, Petr Hlinený, Jan Obdrz&aacu

Real-time Traffic

CORR 2010 | Education |

claim paper

Related Content

» Better Polynomial Algorithms on Graphs of Bounded RankWidth

» Typical random 3SAT formulae and the satisfiability threshold

» New Upper Bounds for Maximum Satisfiability

» Bounded Model Checking with QBF

» Bounds on the Quantum Satisfiability Threshold

» Adding cardinality constraints to integer programs with applications to maximum satisfiabi...

» Solving NonBoolean Satisfiability Problems with Stochastic Local Search

» Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Paramete...

» Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic

Post Info
More Details (n/a)

Added	25 Dec 2010
Updated	25 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Robert Ganian, Petr Hlinený, Jan Obdrzálek

Comments (0)