ResearchTrend.AI
Relating Complexity-theoretic Parameters with SAT Solver Performance

Relating Complexity-theoretic Parameters with SAT Solver Performance

Edward Zulkoski
Ruben Martins
C. Wintersteiger
Robert Robere
J. Liang
Krzysztof Czarnecki
Vijay Ganesh
ArXivPDFHTML

Papers citing "Relating Complexity-theoretic Parameters with SAT Solver Performance"

2 / 2 papers shown
Title
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Albert Atserias
Johannes Fichte
M. Thurley
LRM
62
149
0
16 Jan 2014
SATzilla: Portfolio-based Algorithm Selection for SAT
SATzilla: Portfolio-based Algorithm Selection for SAT
Lin Xu
Frank Hutter
Holger H. Hoos
Kevin Leyton-Brown
98
975
0
31 Oct 2011

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.