6 search results - page 2 / 2 » The 2-SAT Problem of Regular Signed CNF Formulas |
75
Voted
CSR
2007
Springer
15 years 3 months ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...