The Power of Counting Logics on Restricted Classes of Finite Structures

DOI10.1007/978-3-540-74915-8_10zbMath1179.68061OpenAlexW1853910520WikidataQ58215627 ScholiaQ58215627MaRDI QIDQ3608406

David Richerby, Anuj Dawar

Publication date: 5 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_10

Mathematics Subject Classification ID

Graph minors (05C83) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Related Items (4)

CFI Construction and Balanced Graphs ⋮ Benchmark Graphs for Practical Graph Isomorphism ⋮ The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs ⋮ The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs

This page was built for publication: The Power of Counting Logics on Restricted Classes of Finite Structures