Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Fluck, Eva; Seppelt, Tim Frederik; Spitzer, Gian Luca

Journal title: 32nd EACSL Annual Conference on Computer Science Logic : CSL 2024, February 19–23, 2024, Naples, Italy / edited by Aniello Murano, Alexandra Silvapages

Journal publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Published year: 2023

DOI identifier: 10.48550/arxiv.2308.06044