|
|||||
 |
|
|
|
|
|
|
|
|
Thematic Issue on
Complexity
|
|
Contents
|
|
Provenance analysis for
logic and games
203–228
Erich Grädel and Val Tannen |
|
Generalizations of
$k$-dimensional Weisfeiler–Leman stabilization
229–252
Anuj Dawar and Danny Vagnozzi |
|
On defining linear orders
by automata
253–291
Bruno Courcelle, Irène Durand and Michael Raskin |
|
First-order definitions of
subgraph isomorphism through the adjacency and order
relations
293–302
Oleg Grigoryan, Mikhail Makarov and Maksim Zhukovskii |
|
On limit points of spectra
of first-order sentences with quantifier depth 4
303–331
Yury Yarovikov |
|
Weakly distinguishing graph
polynomials on addable properties
333–349
Johann A. Makowsky and Vsevolod Rakita |
