Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable

Theory and Applications of Satisfiability Testing - Lecture Notes in Computer Science ◽

10.1007/11499107_23 ◽

2005 ◽

pp. 309-323 ◽

Cited By ~ 4

Author(s):

Magnus Wahlström

Download Full-text