Fast quantum algorithms for handling probabilistic and interval uncertainty
DOI10.1002/MALQ.200310116zbMath1063.65036OpenAlexW2125453055MaRDI QIDQ3159425
Luc Longpré, Vladik Ya. Kreinovich
Publication date: 16 February 2005
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.utep.edu/cgi/viewcontent.cgi?article=1393&context=cs_techrep
computational complexityerror estimationNP-hardinterval computationsquantum computinginterval uncertaintymeasurement errorsinterval computationprobabilistic uncertaintydada processingpartial information about probabilities
Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Interval and finite arithmetic (65G30) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity and performance of numerical algorithms (65Y20)
Related Items (2)
Uses Software
This page was built for publication: Fast quantum algorithms for handling probabilistic and interval uncertainty