✦ LIBER ✦

Interval arithmetic over finitely many endpoints

✍ Scribed by Siegfried M. Rump

Book ID: 118796538
Publisher: Springer Netherlands
Year: 2012
Tongue: English
Weight: 574 KB
Volume: 52
Category: Article
ISSN: 0006-3835
DOI: 10.1007/s10543-012-0384-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Arithmetic height functions over finitel

Arithmetic height functions over finitely generated fields

✍ Atsushi Moriwaki 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 379 KB

Interval arithmetic and static interval

Interval arithmetic and static interval finite element method

✍ Guo Shu-xiang; Lü Zhen-zhou 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 375 KB

Interval Arithmetic and Static Interval

Interval Arithmetic and Static Interval Finite Element Method

✍ Shu-xiang Guo; Zhen-zhou Lü 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 327 KB

Arithmetical definability over finite st

Arithmetical definability over finite structures

✍ Troy Lee 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract Arithmetical definability has been extensively studied over the natural numbers. In this paper, we take up the study of arithmetical definability over finite structures, motivated by the correspondence between uniform AC^0^ and FO(PLUS, TIMES). We prove finite analogs of three classic r

On arithmetical algorithms over finite f

On arithmetical algorithms over finite fields

✍ David G Cantor 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 758 KB

Parallel polynomial arithmetic over fini

Parallel polynomial arithmetic over finite rings

✍ Robert D. Silverman 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 592 KB

Convolution algorithms for polynomial multiplication are well known, as is the use of Residue Number Systems and the Chinese Remainder Theorem. This paper discusses how these techniques may be used to perform polynomial arithmetic over very large rings or finite fields. The algorithm is practical an