Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings.
J. BuschPublished in: J. Symb. Comput. (2009)
Keyphrases
- decision problems
- lower bound
- objective function
- np hard
- computational complexity
- upper bound
- influence diagrams
- branch and bound algorithm
- utility function
- decision model
- branch and bound
- optimal strategy
- optimal policy
- convex functions
- multiple criteria
- multi objective
- decision processes
- euclidean space
- optimal solution
- sequential decision making
- multicriteria decision
- bayesian decision problems
- bandit problems
- euclidean distance
- decision analysis
- partially observable
- np complete
- linear programming
- vc dimension
- sample complexity
- linear programming relaxation
- genetic algorithm
- special case