First Page | Document Content | |
---|---|---|
Date: 2007-10-26 06:17:09Computing Floating point P5 Division Observable universe Multiplication Cray Computer Software bug Computer arithmetic Mathematics Numbers | Exact computations with approximate arithmeticAdd to Reading ListSource URL: perso.ens-lyon.frDownload Document from Source WebsiteFile Size: 1,63 MBShare Document on Facebook |
Faster multiplication in Z2m[x] on Cortex-M4 to speed up NIST PQC candidatesDocID: 1xVVg - View Document | |
Faster multiplication in Z2m[x] on Cortex-M4 to speed up NIST PQC candidatesDocID: 1xVgU - View Document | |
COSC 544 Probabilistic Proof SystemsAn Optimal Interactive Proof for Matrix Multiplication Lecturer: Justin ThalerDocID: 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 oDocID: 1vqo7 - View Document |