Parameterising the Complexity of Planning by the Number of Paths in the Domain-transition Graphs.

Christer Bäckström

Published in: ECAI (2014)

Keyphrases

domain independent
memory requirements
computational complexity
neural network
space complexity
small number
data structure
state space
np complete
graph matching
random graphs
approximation error
polynomial time complexity