Thematic Issue on Complexity
VOL. 9 · NO. 3 | 2020
 
VIEW ALL ABSTRACTS +
Articles
Erich Grädel, Val Tannen
Mosc. J. Comb. Number Theory 9 (3), 203-228, (2020) DOI: 10.2140/moscow.2020.9.203
KEYWORDS: finite model theory, semiring provenance, games, 03B70, 03C13, 05C57, 68Q19, 91A43
Anuj Dawar, Danny Vagnozzi
Mosc. J. Comb. Number Theory 9 (3), 229-252, (2020) DOI: 10.2140/moscow.2020.9.229
KEYWORDS: Weisfeiler–Leman, combinatorics, invertible map, Graph isomorphism, complexity theory, coherent configuration, 05E15, 05E30, 05E99, 03D15
Bruno Courcelle, Irène Durand, Michael Raskin
Mosc. J. Comb. Number Theory 9 (3), 253-291, (2020) DOI: 10.2140/moscow.2020.9.253
KEYWORDS: enumeration algorithm, diagonal enumeration, graph-walking automaton, linear order, 06A05, 05C38, 68R10, 68P10
Oleg Grigoryan, Mikhail Makarov, Maksim Zhukovskii
Mosc. J. Comb. Number Theory 9 (3), 293-302, (2020) DOI: 10.2140/moscow.2020.9.293
KEYWORDS: first-order logic, subgraph isomorphism, order, logical complexity, quantifier depth, 03C13, 68Q19
Yury Yarovikov
Mosc. J. Comb. Number Theory 9 (3), 303-331, (2020) DOI: 10.2140/moscow.2020.9.303
KEYWORDS: Random graphs, first-order logic, Zero-one law, 05C80
Johann A. Makowsky, Vsevolod Rakita
Mosc. J. Comb. Number Theory 9 (3), 333-349, (2020) DOI: 10.2140/moscow.2020.9.333
KEYWORDS: graph polynomials, Random graphs, Bollobás–Pebody–Riordan conjecture, addable graph classes, 05C31, 05C10, 05C30, 05C69, 05C80
Back to Top