-
Complexity issues in counting, polynomial evaluation and zero finding
In the present thesis, we try to compare the classical boolean complexity with the algebraic complexity, by studying problems related to polynomials. We consider the... -
Communication in Parallel Algorithms for Constraint-Based Local Search
International audience -
Partially Ordered Connectives and Monadic Monotone Strict NP
International audience -
Complexity of Existential Positive First-Order Logic
International audience -
Building Constraint Satisfaction Problem Solvers Using Rewrite Rules & Strate...
Article dans revue scientifique avec comité de lecture. -
COLETTE, Prototyping CSP Solvers Using a Rule-Based Language
Colloque avec actes et comité de lecture.
