Antoine Mottet

1. A universal-algebraic proof of the complexity dichotomy for Monotone\n Monadic SNP
   2018/02/09 by Manuel Bodirsky, Bodirsky, Manuel, Florent Madelaine +3 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #Constraint Satisfaction and Optimization #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge
2. The Containment Problem for Unambiguous Register Automata
   2018/09/24 by Antoine Mottet, Karin Quaas, Mottet, Antoine +1 · 1 citation
   Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Machine Learning and Algorithms #semigroups and automata theory
3. Smooth approximations and CSPs over finitely bounded homogeneous structures
   2020/11/08 by Antoine Mottet, Michael Pinsker, Mottet, Antoine +1 · 1 citation
   Mathematics · #Advanced Operator Algebra Research #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Markov Chains and Monte Carlo Methods #Random Matrices and Applications #Rings and Algebras (math.RA)
4. Algebraic and algorithmic synergies between promise and infinite-domain CSPs
   2025/01/23 by Antoine Mottet, Mottet, Antoine · 1 citation
   Computer Science · Engineering · #Constraint Satisfaction and Optimization #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Scheduling and Optimization Algorithms