
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Excerpt from Fast Parallel Gcd Algorithms for Several Polynomials Over Integral Domain For each i 1, h 1, let 6, We know that pg 61 -q2. Clearly, from Lemma 1, fori. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
This paper investigates the efficiency of parallel algorithms for computing the greatest common divisor (GCD) of multiple polynomials over integral domains. The author, Chung-Jen Ho, presents a detailed analysis of these algorithms, focusing on their performance in parallel computing environments. The work builds upon existing mathematical lemmas and theorems to derive new computational methods, aiming to reduce the time complexity of GCD calculations for polynomials.
This work is a technical paper focusing on advanced mathematical algorithms. The 'Classic Reprint' designation and the publisher's note indicate it is a reproduction of a historical academic text, likely aimed at researchers and students in computer science and mathematics. The content is highly specialized, dealing with the theoretical aspects of polynomial GCD computation in parallel processing environments. Its reception would be within academic circles, valued for its contribution to the field of computational algebra and algorithm design.
Page Count:
32
Publication Date:
2017-12-04
Publisher:
Fb&c Limited
ISBN-10:
0265270014
ISBN-13:
9780265270011
No comments yet. Be the first to share your thoughts!