Sciweavers

131

Voted

ICALP
1999
Springer

70views Programming Languages» more ICALP 1999»

15 years 10 months ago

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

Rolf Niedermeier, Peter Rossmanith

claim paper

Read More »