Ander Gray, Scott Ferson, Olga Kosheleva, Vladik Kreinovich. While, In General, Uncertainty Quantification (UQ) Is NP-Hard, Many Practical UQ Problems Can Be Made Feasible. In IEEE Symposium Series on Computational Intelligence, SSCI 2021, Orlando, FL, USA, December 5-7, 2021. pages 1-6, IEEE, 2021. [doi]
@inproceedings{GrayFKK21,
title = {While, In General, Uncertainty Quantification (UQ) Is NP-Hard, Many Practical UQ Problems Can Be Made Feasible},
author = {Ander Gray and Scott Ferson and Olga Kosheleva and Vladik Kreinovich},
year = {2021},
doi = {10.1109/SSCI50451.2021.9659990},
url = {https://doi.org/10.1109/SSCI50451.2021.9659990},
researchr = {https://researchr.org/publication/GrayFKK21},
cites = {0},
citedby = {0},
pages = {1-6},
booktitle = {IEEE Symposium Series on Computational Intelligence, SSCI 2021, Orlando, FL, USA, December 5-7, 2021},
publisher = {IEEE},
isbn = {978-1-7281-9048-8},
}