Error estimation for indirect measurements: Interval computation problem is (slightly) harder than a similar probabilistic computational problem (Q1300089)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Error estimation for indirect measurements: Interval computation problem is (slightly) harder than a similar probabilistic computational problem |
scientific article; zbMATH DE number 1333004
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Error estimation for indirect measurements: Interval computation problem is (slightly) harder than a similar probabilistic computational problem |
scientific article; zbMATH DE number 1333004 |
Statements
Error estimation for indirect measurements: Interval computation problem is (slightly) harder than a similar probabilistic computational problem (English)
0 references
2 August 2000
0 references
The authors study the complexity of probabilistic computational problems related to indirect measurements whenever the estimate function is: a) a polynomial; b) a rational function. In case a) the existence of a polynomial time algorithm is demonstrated, whereas in case b) NP-hardness established.
0 references
error estimation
0 references
computational complexity
0 references
interval arithmetic
0 references
probabilistic computational problems
0 references
indirect measurements
0 references
polynomial time algorithm
0 references
NP-hardness
0 references
