Login / Signup
A complete parameterized complexity analysis of bounded planning.
Christer Bäckström
Peter Jonsson
Sebastian Ordyniak
Stefan Szeider
Published in:
J. Comput. Syst. Sci. (2015)
Keyphrases
</>
complexity analysis
theoretical analysis
path finding
planning problems
lower bound
data sets
first order logic
computational complexity
website
domain specific
decision support
knowledge representation
heuristic search
domain independent
decision theoretic
information systems
database
continuous functions