Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach

DOI10.1007/978-3-642-22993-0_47zbMath1343.68120arXiv1104.3057MaRDI QIDQ3088068

Michał Pilipczuk

Publication date: 17 August 2011

Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.3057

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03B45: Modal logic (including the logic of norms)

68Q60: Specification and verification (program logics, model checking, etc.)

03D15: Complexity of computation (including implicit computational complexity)