On a refined analysis of some problems in interval arithmetic using real number complexity theory

DOI10.1023/B:REOM.0000032109.55408.1azbMath1055.65061OpenAlexW2105339562MaRDI QIDQ1826441

Klaus Meer

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1023/b:reom.0000032109.55408.1a

zbMATH Keywords

NP-hardquadratic functionpolynomial time reductionsbest linear interval approximation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Interval and finite arithmetic (65G30)

Related Items

Grey dynamic input-output analysis ⋮ Complexity aspects of a semi-infinite optimization problem†