A combinatorial and logical approach to linear-time computability (extended abstract)

DOI10.1007/3-540-51517-8_142zbMath1209.90362OpenAlexW1436049927MaRDI QIDQ5393366

Petra Scheffler, Detlef Seese

Publication date: 16 April 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-51517-8_142

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Tree-edges deletion problems with bounded diameter obstruction sets ⋮ Grids and their minors ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ The Space Complexity of k-Tree Isomorphism ⋮ Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families ⋮ The structure of the models of decidable monadic theories of graphs

This page was built for publication: A combinatorial and logical approach to linear-time computability (extended abstract)