Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors (Q4943883)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1417102
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors |
scientific article; zbMATH DE number 1417102 |
Statements
Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors (English)
0 references
19 March 2000
0 references
floating-point summation
0 references
error analysis
0 references
addition trees
0 references
combinatorial optimization
0 references
NP-hardness
0 references
approximation algorithms
0 references
roundoff error
0 references
0.87873435
0 references
0 references
0 references
0.8613208
0 references
0.85948014
0 references
