Parameterized Complexity and Kernel Bounds for Hard Planning Problems
From MaRDI portal
Publication:4924634
DOI10.1007/978-3-642-38233-8_2zbMath1382.68098arXiv1211.0479OpenAlexW1559565827MaRDI QIDQ4924634
Stefan Szeider, Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
Publication date: 7 June 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.0479
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Guarantees and limits of preprocessing in constraint satisfaction and reasoning ⋮ A complete parameterized complexity analysis of bounded planning
This page was built for publication: Parameterized Complexity and Kernel Bounds for Hard Planning Problems
