Range Estimation Is NP-Hard for ε2 Accuracy and Feasible for ε2−δ

Range Estimation Is NP-Hard for ε2 Accuracy and Feasible for ε2−δ 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−δ. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Reliable Computing Springer Journals

Range Estimation Is NP-Hard for ε2 Accuracy and Feasible for ε2−δ

Loading next page...
 
/lp/springer_journal/range-estimation-is-np-hard-for-2-accuracy-and-feasible-for-2-MVjiEVicRQ
Publisher
Springer Journals
Copyright
Copyright © 2002 by Kluwer Academic Publishers
Subject
Mathematics; Numeric Computing; Approximations and Expansions; Computational Mathematics and Numerical Analysis; Mathematical Modeling and Industrial Mathematics
ISSN
1385-3139
eISSN
1573-1340
D.O.I.
10.1023/A:1021368627321
Publisher site
See Article on Publisher Site

Abstract

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−δ.

Journal

Reliable ComputingSpringer Journals

Published: Oct 13, 2004

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

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.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off