Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars.
Sebastian EberhardGabriel EbnerStefan HetzlPublished in: DLT (2018)
Keyphrases
- decision problems
- np hard
- tree grammars
- conp complete
- computational complexity
- influence diagrams
- utility function
- pspace complete
- decision model
- optimal policy
- multiple criteria
- bounded treewidth
- optimal strategy
- np complete
- partially observable
- optimal solution
- sequential decision making
- decision processes
- lower bound
- regular languages
- bandit problems
- objective function
- decision makers
- search algorithm
- multi objective