 | 2007 |
|---|
| 6 |       | Philippe Chapdelaine,
Miki Hermann,
Ilka Schnoor:
Complexity of Default Logic on Generalized Conjunctive Queries.
LPNMR 2007: 58-70 |
| 2006 |
|---|
| 5 | | Philippe Chapdelaine,
Etienne Grandjean:
Lower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes
CoRR abs/cs/0606058: (2006) |
| 4 | | Philippe Chapdelaine:
On the structure of linear-time reducibility
CoRR abs/cs/0606080: (2006) |
| 2005 |
|---|
| 3 | | Philippe Chapdelaine,
Nadia Creignou:
The complexity of Boolean constraint satisfaction local search problems.
Ann. Math. Artif. Intell. 43(1): 51-63 (2005) |
| 2004 |
|---|
| 2 | | Michael Bauland,
Philippe Chapdelaine,
Nadia Creignou,
Miki Hermann,
Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
SAT 2004 |
| 1 | | Michael Bauland,
Philippe Chapdelaine,
Nadia Creignou,
Miki Hermann,
Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.
SAT (Selected Papers 2004: 30-45 |
