In Search of the Hard Instances

Visit talk page

A Survey of Automatability

Visit talk page

On Bounded Depth Proofs For Tseitin Formulas On The Grid; Revisited

Visit talk page

CDCL SAT Solving and Applications to Optimization Problems

Visit talk page

IPASIR-UP: User Propagators for CDCL

Visit talk page

Designing Samplers is Easy: The Boon of Testers

Visit talk page

Structure-guided Local Improvement for Maximum Satisfiability

Visit talk page

A Roadmap for the Next Phase of SAT Research

Visit talk page

Isomorph-Free Generation Of Combinatorial Objects With Sat Modulo Symmetries

Visit talk page

Beyond SAT - Proofs for QBF, and more

Visit talk page