## Abstract

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 their applications.

Original language | English |
---|---|

Title of host publication | 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) |

Editors | Heribert Vollmer, Brigitte Vallée |

Number of pages | 5 |

Volume | 66 |

Place of Publication | Dagstuhl, Germany |

Publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |

Publication date | 01.03.2017 |

Pages | 1-4 |

ISBN (Print) | 978-3-95977-028-6 |

DOIs | |

Publication status | Published - 01.03.2017 |

Event | 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) - Hannover, Germany Duration: 08.03.2017 → 11.03.2017 https://stacs2017.thi.uni-hannover.de/ |