Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Durand, Arnaud - Équipe de Logique Mathématique, Université Paris 7 - Denis Diderot
On the Counting Complexity of Propositional Circumscription
First-Order Queries over One Unary Function Arnaud Durand1
First-order queries on structures of bounded degree are computable with constant delay
Trichotomies in the Complexity of Minimal Inference Arnaud Durand
The expressive power of bijections over weakly arithmetized Etienne Ailloud
Efficient Enumeration for Conjunctive Queries over X-underbar Structures
Universite Paris 12 -Val de marne Memoire d'habilitation `a diriger des recherches
L1 -Algbre et analyse lmentaires -MP1 Samedi 19 novembre 2005 (16h 19h)
New results on arity vs. number of variables Arnaud Durand
arXiv:cs.LO/0605008v12May2006 The complexity of acyclic conjunctive queries revisited
A simple proof of the polylog counting ability of first-order Arnaud Durand
(et bonnes vacances) 1 Logique formelle
L1 -Algbre et analyse lmentaires -MP1 Samedi 19 novembre 2005 (16h 19h)
FIFTY YEARS OF THE SPECTRUM PROBLEM: SURVEY AND NEW RESULTS
Universite Denis Diderot Paris 7 Semestre septembre 2006-janvier 2007 Devoir Maison N1
L3 -Mathmatiques, informatique Travaux pratiques en Maple
Licence Mathmatiques -Enseignement Mathmatique et informatique
Trichotomy in the Complexity of Minimal Inference Arnaud Durand
Subclasses of Binary NPDecember 5, 1996 Arnaud Durand
Hierarchies de de nissabilite logique au second ordre
On acyclic conjunctive queries and constant delay enumeration
Corrige du partiel du 25 novembre Exercice 1. (2 points)
