Search the dblp DataBase
Philippe Chapdelaine: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Philippe Chapdelaine, Miki Hermann, Ilka Schnoor
Complexity of Default Logic on Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
LPNMR, 2007, pp:58-70 [Conf] - Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
SAT, 2004, pp:- [Conf] - Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
SAT (Selected Papers, 2004, pp:30-45 [Conf] - Philippe Chapdelaine, Nadia Creignou
The complexity of Boolean constraint satisfaction local search problems. [Citation Graph (0, 0)][DBLP]
Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:51-63 [Journal] - Philippe Chapdelaine, Etienne Grandjean
Lower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal] - Philippe Chapdelaine
On the structure of linear-time reducibility [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002