101
click to vote
ICALP
1999
Springer
15 years 7 months ago
1999
Springer
We describe exact algorithms that provide new upper bounds for the Maximum Satisfiability problem (MaxSat). We prove