Time-space trade-off lower bounds for randomized computation of decision problems.
Paul BeameMichael E. SaksXiaodong SunErik VeePublished in: J. ACM (2003)
Keyphrases
- decision problems
- trade off
- lower bound
- np hard
- influence diagrams
- decision model
- optimal policy
- utility function
- computational complexity
- multiple criteria
- upper bound
- objective function
- optimal strategy
- data mining
- partially observable
- decision processes
- randomized algorithm
- bandit problems
- multicriteria decision
- sequential decision making
- decision analysis
- search space
- optimal solution
- machine learning