|
СТ |
Describing Parameterized Complexity Classes |
2002 |
Flum J., Grohe M. |
|
|
|
Lecture Notes in Computer Science |
30.03.2002 |
|
СТ |
Query Evaluation via Tree-Decompositions. Extended Abstract |
2000 |
Flum J., Frick M., Grohe M. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
30.01.2001 |
|
СТ |
Descriptive and Parametrized Complexity |
1999 |
Grohe M. |
|
|
|
Lecture Notes in Computer Science |
12.11.1999 |
|
СТ |
Definability and Descriptive Complexity on Databases of Bounded Tree-Width |
1998 |
Grohe M., Marino J. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
29.01.1999 |
|
СТ |
Canonization for L -equivalence is Hard |
1998 |
Grohe M. |
|
|
|
Lecture Notes in Computer Science |
19.06.1998 |
|
СТ |
Bounded-arity Hierarchies in Fixed-point Logics |
1994 |
Grohe M. |
|
|
|
Lecture Notes in Computer Science |
25.08.1994 |
