"Unrestricted Faithful Rounding is Good Enough for Some LNS Applications."

Mark G. Arnold, Colin D. Walter (2001)

> Home

Details and statistics

DOI: 10.1109/ARITH.2001.930125

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/arith/ArnoldW01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/arith/ArnoldW01
Mark G. Arnold, Colin D. Walter:
Unrestricted Faithful Rounding is Good Enough for Some LNS Applications. IEEE Symposium on Computer Arithmetic 2001: 237-246

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.