The basic problem of interval computations is: given a function f(x 1,..., x n) and n intervals [x i, x i], find the (interval) range yof the given function on the given intervals. It is known that even for quadratic polynomials f(x 1,..., x n), this problem is NP-hard. In this paper, following the advice of A. Neumaier, we analyze the complexity of asymptotic range estimation, when the bound ε on the width of the input intervals tends to 0. We show that for small c > 0, if we want to compute the range with an accuracy c ⋅ ε2, then the problem is still NP-hard; on the other hand, for every δ > 0, there exists a feasible algorithm which asymptotically, estimates the range with an accuracy c ⋅ ε2−δ.
Reliable Computing – Springer Journals
Published: Oct 13, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.
All for just $49/month
Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.
Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.
It’s easy to organize your research with our built-in tools.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera