Unrestricted Faithful Rounding is Good Enough for Some LNS Applications.
Mark G. Arnold, Colin D. Walter
VenueCARITH
Year2001
ProceedingsIEEE Symposium on Computer Arithmetic
DBLP recordconf/arith/ArnoldW01 ↗
Browse the full ARITH paper archive.
Mark G. Arnold, Colin D. Walter
Browse the full ARITH paper archive.