A Gentle Introduction to Applications of Algorithmic Metatheorems for Space and Circuit Classes
AbstractAlgorithmic 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 valuable tools 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. This paper is intended as a gentle introduction to the ideas behind algorithmic metatheorems, especially behind some recent results concerning space and circuit classes, and tries to give a flavor of the range of their applications. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Tantau, T. A Gentle Introduction to Applications of Algorithmic Metatheorems for Space and Circuit Classes. Algorithms 2016, 9, 44.
Tantau T. A Gentle Introduction to Applications of Algorithmic Metatheorems for Space and Circuit Classes. Algorithms. 2016; 9(3):44.Chicago/Turabian Style
Tantau, Till. 2016. "A Gentle Introduction to Applications of Algorithmic Metatheorems for Space and Circuit Classes." Algorithms 9, no. 3: 44.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.