<--- Back to Details
First PageDocument Content
Computer arithmetic / Arithmetic / Computing / Binary arithmetic / Theory of computation / Data types / IEEE standards / Decimal64 floating-point format / IEEE 754 / Double-precision floating-point format / cole normale suprieure de Lyon / Algorithm
Date: 2017-07-31 08:52:27
Computer arithmetic
Arithmetic
Computing
Binary arithmetic
Theory of computation
Data types
IEEE standards
Decimal64 floating-point format
IEEE 754
Double-precision floating-point format
cole normale suprieure de Lyon
Algorithm

Formal Correctness of Comparison Algorithms between Binary64 and Decimal64 Floating-point Numbers Arthur Blot ENS Lyon, France NSV, July 22-23, 2017

Add to Reading List

Source URL: www.cs.ox.ac.uk

Download Document from Source Website

File Size: 190,82 KB

Share Document on Facebook

Similar Documents

FAST ROUNDING  OF FLOATING POINT NUMBERS

FAST ROUNDING OF FLOATING POINT NUMBERS

DocID: 1rtx5 - View Document

CS:APP Web Aside DATA:IA32-FP: Intel IA32 Floating-Point Arithmetic∗ Randal E. Bryant David R. O’Hallaron June 5, 2012

CS:APP Web Aside DATA:IA32-FP: Intel IA32 Floating-Point Arithmetic∗ Randal E. Bryant David R. O’Hallaron June 5, 2012

DocID: 1rpCG - View Document

Lineare Algebra  Endliche Arithmetik Walter Gander ETH Z¨ urich

Lineare Algebra Endliche Arithmetik Walter Gander ETH Z¨ urich

DocID: 1rfwa - View Document

Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format Vincent Lefèvre, Damien Stehlé, Paul Zimmermann LORIA / INRIA Lorraine  JNAO 2006

Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format Vincent Lefèvre, Damien Stehlé, Paul Zimmermann LORIA / INRIA Lorraine JNAO 2006

DocID: 1reF1 - View Document

Hardest-to-Round Cases – Part 2 Vincent LEFÈVRE AriC, INRIA Grenoble – Rhône-Alpes / LIP, ENS-Lyon Journées TaMaDi, Lyon,

Hardest-to-Round Cases – Part 2 Vincent LEFÈVRE AriC, INRIA Grenoble – Rhône-Alpes / LIP, ENS-Lyon Journées TaMaDi, Lyon,

DocID: 1rccC - View Document