Sciweavers

ICALP
1999
Springer
13 years 11 months ago
New Upper Bounds for MaxSat
We describe exact algorithms that provide new upper bounds for the Maximum Satisfiability problem (MaxSat). We prove
Rolf Niedermeier, Peter Rossmanith