Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Philippe Chapdelaine
2000 – 2009
- 2007
[c3]Philippe Chapdelaine, Miki Hermann, Ilka Schnoor: Complexity of Default Logic on Generalized Conjunctive Queries. LPNMR 2007: 58-70- 2006
[i2]Philippe Chapdelaine, Etienne Grandjean: Lower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes. CoRR abs/cs/0606058 (2006)
[i1]- 2005
[j1]Philippe Chapdelaine, Nadia Creignou: The complexity of Boolean constraint satisfaction local search problems. Ann. Math. Artif. Intell. 43(1): 51-63 (2005)- 2004
[c2]Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT 2004
[c1]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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-09-10 15:58 CEST by the dblp team



