no code implementations • 16 Feb 2021 • Wojciech Czerwiński, Antoine Mottet, Karin Quaas
Recently, we proved the problem to be decidable in 2-ExpSpace if the register automaton under study is over $(\mathbb N;=)$ and unambiguous, i. e., every input word has at most one accepting run; this result was shortly after improved to 2-ExpTime by Barloy and Clemente.
Formal Languages and Automata Theory
no code implementations • 8 Nov 2020 • Antoine Mottet, Michael Pinsker
We develop the novel machinery of smooth approximations, and apply it to confirm the CSP dichotomy conjecture for first-order reducts of the random tournament, various homogeneous graphs including the random graph, and for expansions of the order of the rationals.
Logic in Computer Science Computational Complexity Logic Rings and Algebras
no code implementations • 13 Jun 2020 • Manuel Bodirsky, Antoine Mottet, Miroslav Olšák, Jakub Opršal, Michael Pinsker, Ross Willard
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable if the model-complete core of the template has a pseudo-Siggers polymorphism, and NP-complete otherwise.
Logic Logic in Computer Science Rings and Algebras
