<--- Back to Details
First PageDocument Content
Computing / Floating point / P5 / Division / Observable universe / Multiplication / Cray / Computer / Software bug / Computer arithmetic / Mathematics / Numbers
Date: 2007-10-26 06:17:09
Computing
Floating point
P5
Division
Observable universe
Multiplication
Cray
Computer
Software bug
Computer arithmetic
Mathematics
Numbers

Exact computations with approximate arithmetic

Add to Reading List

Source URL: perso.ens-lyon.fr

Download Document from Source Website

File Size: 1,63 MB

Share Document on Facebook

Similar Documents

Mathematics / Algebra / Abstract algebra / Multiplication / Polynomials / ToomCook multiplication / NTRUEncrypt / Multiplication algorithm / Karatsuba algorithm / Division algorithm / Resultant / XTR

Faster multiplication in Z2m[x] on Cortex-M4 to speed up NIST PQC candidates

DocID: 1xVVg - View Document

Mathematics / Algebra / Abstract algebra / Multiplication / Polynomials / ToomCook multiplication / NTRUEncrypt / Multiplication algorithm / Karatsuba algorithm / Division algorithm / Resultant / XTR

Faster multiplication in Z2m[x] on Cortex-M4 to speed up NIST PQC candidates

DocID: 1xVgU - View Document

Mathematics / Algebra / Exponentials / Matrix theory / IP / Summation / Exponentiation

COSC 544 Probabilistic Proof SystemsAn Optimal Interactive Proof for Matrix Multiplication Lecturer: Justin Thaler

DocID: 1xUI5 - View Document

Optimization Techniques for Small Matrix Multiplication ´ Charles-Eric Drevet ´

DocID: 1vrNt - View Document

Contemporary Mathematics The geometry of efficient arithmetic on elliptic curves David Kohel Abstract. The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms o

DocID: 1vqo7 - View Document