✦ LIBER ✦

THE ROOT PROBLEM IN COMPLEX F-ALGEBRAS

✍ Scribed by Venter, Lucas M

Book ID: 118159551
Publisher: Taylor and Francis Group
Year: 1992
Tongue: English
Weight: 225 KB
Volume: 15
Category: Article
ISSN: 1607-3606
DOI: 10.1080/16073606.1992.9631672

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The roots of complex problems

✍ Gowers, Timothy 📂 Article 📅 2007 🏛 Nature Publishing Group 🌐 English ⚖ 153 KB

Algorithms in Algebraic Topology and Hom

Algorithms in Algebraic Topology and Homological Algebra: Problem of Complexity

✍ P. R. Hurado; V. Álvarez; J. A. Armario; R. González-Díaz 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 328 KB

Computing the Additive Complexity of Alg

Computing the Additive Complexity of Algebraic Circuits with Root Extracting

✍ Grigoriev, Dima; Karpinski, Marek 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 287 KB

On algebraic problems in the theory of c

On algebraic problems in the theory of complex angular momentum

✍ G. Domokos 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 205 KB

An Efficient Algorithm for the Complex R

An Efficient Algorithm for the Complex Roots Problem

✍ C.Andrew Neff; John H. Reif 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 406 KB

Given a univariate polynomial f (z) of degree n with complex coefficients, whose norms are less than 2 m in magnitude, the root problem is to find all the roots of f (z) up to specified precision 2 ϪȐ . Assuming the arithmetic model for computation, we provide an algorithm which has complexity O(n l

Computability of the additive complexity

Computability of the additive complexity of algebraic circuits with root extracting

✍ Dima Grigoriev; Marek Karpinski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 643 KB