Sciweavers

105

Voted

SAT
2007
Springer

146views Hardware» more SAT 2007»

Algorithms for Variable-Weighted 2-SAT and Dual Problems

15 years 8 months ago

Abstract. In this paper we study NP-hard weighted satisﬁability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...

Stefan Porschen, Ewald Speckenmeyer

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Sciweavers