𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient parallel algorithm for the single function coarsest partition problem

✍ Scribed by Joseph F. Jájá; Kwan Woo Ryu


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
1006 KB
Volume
129
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


An Efficient Algorithm for the Complex R
✍ 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