2 search results - page 1 / 1 » tts: A SAT-Solver for Small, Difficult Instances |
62
Voted
JSAT
2008
14 years 10 months ago
2008
The Ternary Tree Solver (tts) is a complete solver for propositional satisfiability which was designed to have good performance on the most difficult small instances. It uses a st...
64
Voted
DAC
2002
ACM
15 years 11 months ago
2002
ACM
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...