✦ LIBER ✦

Correction to “Computational complexity of algebraic functions”

✍ Scribed by Nicholas Pippenger

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 269 KB
Volume: 37
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(88)90015-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational Complexity of Algebraic Fu

Computational Complexity of Algebraic Functions

✍ Nicholas Pippenger 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 919 KB

Semi-algebraic Complexity—Additive Compl

Semi-algebraic Complexity—Additive Complexity of Matrix Computational Tasks

✍ Thomas Lickteig; Klaus Meer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 621 KB

The computational complexity of a set of

The computational complexity of a set of quadratic functions

✍ Joseph Ja'Ja' 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 582 KB

Correction to “Units of Algebraic Number

Correction to “Units of Algebraic Numberfields”

✍ Charles J. Parry 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 53 KB

Computing in the Field of Complex Algebr

Computing in the Field of Complex Algebraic Numbers

✍ ADAM WOJCIECH STRZEBOŃSKI 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 371 KB

In this paper we present two methods of computing with complex algebraic numbers. The first uses isolating rectangles to distinguish between the roots of the minimal polynomial, the second method uses validated numeric approximations. We present algorithms for arithmetic and for solving polynomial e

An Algebraic Computational Approach to t

An Algebraic Computational Approach to the Identifiability of Fourier Models

✍ M. Caboara; E. Riccomagno 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 506 KB

Computer algebra and in particular Gröbner bases are powerful tools in experimental design (Pistone and Wynn, 1996, Biometrika 83, 653-666). This paper applies this algebraic methodology to the identifiability of Fourier models. The choice of the class of trigonometric models forces one to deal with