2026-07-24T00:04:28Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7030 2024-03-06T10:39:07Z ddc:004 open_access

Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk) Tantau, Till Algorithmic metatheorems Courcelle’s Theorem tree width monadic second-order logic logarithmic space parallel computations Algorithmic metatheorems state that if a problem can be described in a certain logic and the inputs are structured in a certain way, then the problem can be solved with a certain amount of resources. As an example, by Courcelle's Theorem all monadic second-order ("in a certain logic") properties of graphs of bounded tree width ("structured in a certain way") can be solved in linear time ("with a certain amount of resources"). Such theorems have become a valuable tool in algorithmics: If a problem happens to have the right structure and can be described in the right logic, they immediately yield a (typically tight) upper bound on the time complexity of the problem. Perhaps even more importantly, several complex algorithms rely on algorithmic metatheorems internally to solve subproblems, which considerably broadens the range of applications of these theorems. The talk is intended as a gentle introduction to the ideas behind algorithmic metatheorems, especially behind some recent results concerning space classes and parallel computation, and tries to give a flavor of the range of Schloss Dagstuhl – Leibniz-Zentrum für Informatik Till Tantau 2017 Is Part Of LIPIcs, Volume 66, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2017.4 urn:nbn:de:0030-drops-70303 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.4 eng https://creativecommons.org/licenses/by/3.0/legalcode