Birs- 18w5208: Theory and Practice of Satisfiability Solving
-
Title: Towards an (experimental) understanding of SAT Solvers
Speaker:
Link:
-
Title: Introduction to Proof Complexity for SAT practitioner
Speaker:
Link:
-
Title: Computable Short Proofs
Speaker:
Link:
-
Title: Symmetry in SAT - a quest for pigeonhole
Speaker:
Link:
-
Title: Seeking Practical CDCL Insights from Theoretical SAT Benchmarks
Speaker:
Link:
-
Title: Clique Is Hard for State-of-the-Art Algorithms
Speaker:
Link:
-
Title: Boolean Satisfiability: Theory and Engineering
Speaker:
Link:
-
Title: Towards Faster Conflict-Driven Pseudo-Boolean Solving
Speaker:
Link:
-
Title: Computational Mixed-Integer Programming
Speaker:
Link:
-
Title: Towards MaxSAT-Based Proof Systems
Speaker:
Link:
-
Title: Formal Analysis of Deep Binarized Neural Networks
Speaker:
Link:
-
Title: Pseudo-Boolean Optimization
Speaker:
Link:
-
Title: Proof Systems for Pseudo-Boolean Solving
Speaker:
Link:
-
Title: The (un)reasonable (in)effectiveness of theory for Sat solvers
Speaker:
Link:
-
Title: Advances in QBF Solving
Speaker:
Link:
-
Title: Hilbert's Nullstellensatz, Grobner Bases, and NP-Complete Problems
Speaker:
Link:
-
Title: QBF Proof Complexity
Speaker:
Link:
-
Title: Gröbner bases and applications
Speaker:
Link:
-
Title: A Survey on Worst-Case Complexity of SAT
Speaker:
Link:
-
Title: Random k-sat. A review and some new results.
Speaker:
Link: