Similar Items: A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm
- A Static Analysis Framework for Livelock Freedom in CSP
- Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
- URSA: A System for Uniform Reduction to SAT
- SAT-Inspired Higher-Order Eliminations
- Algorithmic randomness for Doob's martingale convergence theorem in continuous time
- Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs