The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems).
Martin FürerPublished in: Logic and Machines (1983)
Keyphrases
- decision problems
- computational complexity
- influence diagrams
- decision model
- utility function
- np hard
- optimal policy
- multiple criteria
- optimal strategy
- bayesian decision problems
- sequential decision making
- decision processes
- partially observable
- pspace complete
- bandit problems
- decision making
- memory requirements
- special case
- expressive power
- np complete
- expected utility theory
- dynamic programming