TSAT algorithm triples tractable sizes for hardest random 3-SAT instances by actively targeting clause-type distributions in local search.
Kullmann, Present and future of practical sat solving, inComplexity of Constraints: An Overview of Current Research Themes, edited by N
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cond-mat.stat-mech 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Targeting Clause Type Distributions: a Picklock for Random Satisfiability Problems
TSAT algorithm triples tractable sizes for hardest random 3-SAT instances by actively targeting clause-type distributions in local search.