Polynomial Time Algorithms for Determining Optimal Strategies.
Dmitrii LozovanuStefan PicklPublished in: Electron. Notes Discret. Math. (2003)
Keyphrases
- optimal strategy
- computational complexity
- computational cost
- theoretical analysis
- computationally efficient
- data structure
- significant improvement
- upper bound
- worst case
- orders of magnitude
- computationally tractable
- data mining
- approximation algorithms
- greedy algorithm
- benchmark datasets
- state space
- learning algorithm