New Upper Bounds for MaxSat

14 years 4 months ago

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

Rolf Niedermeier, Peter Rossmanith

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

claim paper

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

Comments (0)