Strong bounds on the approximability of two Pspace-hard problems in propositional planning

DOI10.1023/A:1018954827926zbMath0940.68129OpenAlexW1518269166MaRDI QIDQ1978020

Peter Jonsson

Publication date: 7 June 2000

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018954827926

zbMATH Keywords

computational complexity of planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics ⋮ Computational Complexity of Computing Symmetries in Finite-Domain Planning ⋮ A complete parameterized complexity analysis of bounded planning

This page was built for publication: Strong bounds on the approximability of two Pspace-hard problems in propositional planning