Sciweavers

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

27

ICALP
1999
Springer

favoriteEmaildiscussreport

70views Programming Languages» more ICALP 1999»

New Upper Bounds for MaxSat

14 years 3 months ago

New Upper Bounds for MaxSat

Download theinf1.informatik.uni-jena.de

We describe exact algorithms that provide new upper bounds for the Maximum Satisﬁability problem (MaxSat). We prove

Rolf Niedermeier, Peter Rossmanith

Real-time Traffic

ICALP 1999 | Maximum Satisﬁability Problem | Programming Languages |

claim paper

Related Content

» New Upper Bounds for Maximum Satisfiability

» On Inconsistent ClauseSubsets for MaxSAT Solving

» MiniMaxSat A New Weighted MaxSAT Solver

» MiniMaxSAT An Efficient Weighted MaxSAT solver

» A New Upper Bound for Max2Sat A GraphTheoretic Approach

» MaxSolver An efficient exact algorithm for weighted maximum satisfiability

» A MaxSAT Solver with Lazy Data Structures

» Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for MaxSAT

» Improved Exact Solvers for Weighted MaxSAT

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	ICALP
Authors	Rolf Niedermeier, Peter Rossmanith

Comments (0)