193 citations · 285 across the 27 of their papers we have counts for
31 papers
A characterization of functions over the integers computable in polynomial time using discrete differential equations
Olivier Bournez, Arnaud Durand
This paper studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs), a.k.a. (Ordinary) Difference Equations. It presents a new framework us…
Enumeration Classes Defined by Circuits
Nadia Creignou, Arnaud Durand, Heribert Vollmer
We refine the complexity landscape for enumeration problems by introducing very low classes defined by using Boolean circuits as enumerators. We locate well-known enumeration probl…
Modular SAT-based techniques for reasoning tasks in team semantics
Arnaud Durand, Juha Kontinen, Jouko Väänänen
We study the complexity of reasoning tasks for logics in team semantics. Our main focus is on the data complexity of model checking but we also derive new results for logically def…
Enumerating Answers to First-Order Queries over Databases of Low Degree
Arnaud Durand, Nicole Schweikardt, Luc Segoufin
A class of relational databases has low degree if for all , all but finitely many databases in the class have degree at most , where is the size of the database. Typi…
Recursion schemes, discrete differential equations and characterization of polynomial time computation
Olivier Bournez, Arnaud Durand, Sabrina Ouazzani
This papers studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs). It presents a new framework using discrete ODEs as a central tool for…
Probabilistic team semantics
Arnaud Durand, Miika Hannula, Juha Kontinen +2
Team semantics is a semantical framework for the study of dependence and independence concepts ubiquitous in many areas such as databases and statistics. In recent works team seman…