On classes of bounded tree rank, their interpretations, and efficient sparsification

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: Gajarský, Jakub; McCarty, Rose

Journal title: 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024

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

Published year: 2024

DOI identifier: 10.48550/arxiv.2404.18904