scientific article

zbMath0745.68099MaRDI QIDQ4012203

Christer Bäckström, Inger Klein

Publication date: 27 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parallel planningpolynomial time planning algorithmtractable classes of planning problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)

Related Items

The computational complexity of propositional STRIPS planning, A probabilistic analysis of propositional STRIPS planning, Policy analysis for administrative role-based access control, On the computational complexity of temporal projection, planning, and plan validation