z-logo
open-access-imgOpen Access
The Complexity of Planning Revisited — A Parameterized Analysis
Author(s) -
Christer Bäckström,
Yue Chen,
Peter Jönsson,
Sebastian Ordyniak,
Stefan Szeider
Publication year - 2021
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v26i1.8361
Subject(s) - parameterized complexity , planner , computer science , simple (philosophy) , heuristic , computational complexity theory , exploit , heuristics , order (exchange) , theoretical computer science , algorithm , mathematical optimization , mathematics , artificial intelligence , epistemology , philosophy , computer security , finance , economics , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom