While, In General, Uncertainty Quantification (UQ) Is NP-Hard, Many Practical UQ Problems Can Be Made Feasible.
Ander GrayScott FersonOlga KoshelevaVladik KreinovichPublished in: SSCI (2021)
Keyphrases
- np hard
- special case
- np complete
- computationally challenging
- practical problems
- closely related
- computationally hard
- problems involving
- decision problems
- practical solutions
- computationally feasible
- optimization problems
- computational problems
- data sets
- scheduling problem
- optimal solution
- case study
- decision trees
- artificial intelligence
- data mining
- real world