Christoph Haase
Home
Biography
Publications
Students
Contact
Alessio Mansutti
Latest
Integer Programming with GCD Constraints
On Polynomial-Time Decidability of $k$-Negations Fragments of FO Theories (Extended Abstract)
Geometric decision procedures and the VC dimension of linear arithmetic theories
Quantifier elimination for counting extensions of Presburger arithmetic
Higher-Order Quantified Boolean Satisfiability
On deciding linear arithmetic constraints over $p$-adic integers for all primes
Cite
×