2 search results - page 1 / 1 » Solving minones-2-sat as Fast as vertex cover |
MFCS
2010
Springer
13 years 2 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
ICCAD
2002
IEEE
14 years 1 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...