๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel algorithms for some algebraic operations on polynomial equations

โœ Scribed by Xiaodong Zhang; Hao Lu; Ervin Y. Rodin

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
649 KB
Volume
13
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On Efficient Parallel Algorithms for Sol
On Efficient Parallel Algorithms for Solving Set Recurrence Equations
โœ O.H. Ibarra; H. Wang; T. Jiang ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 545 KB

We present two EREW PRAM algorithms and one CREW PRAM algorithm for solving set recurrence equations of the type commonly used in dynamic programming solutions to many problems in pattern matching, sequence comparison, and language recognition. All three algorithms run in \(O\left(\log ^{2} n\right)

A Polynomial Time Algorithm for Diophant
A Polynomial Time Algorithm for Diophantine Equations in One Variable
โœ F CUCKER; P KOIRAN; S SMALE ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 195 KB

We exhibit an algorithm computing, for a polynomial f โˆˆ Z [t], the set of its integer roots. The running time of the algorithm is polynomial in the size of the sparse encoding of f .