Range estimation is NP-hard for \({\varepsilon}^{2}\) accuracy and feasible for \({\varepsilon}^{2-\delta}\)

DOI10.1023/A:1021368627321zbMATH Open1071.65069OpenAlexW33079676MaRDI QIDQ1869604

Vladik Kreinovich

Publication date: 28 April 2003

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021368627321

zbMATH Keywords

complexityalgorithmNP-hardasymptotic range estimationinterval compulations

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Complexity and performance of numerical algorithms (65Y20)

This page was built for publication: Range estimation is NP-hard for \({\varepsilon}^{2}\) accuracy and feasible for \({\varepsilon}^{2-\delta}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869604)