Items related to Fast Parallel Gcd Algorithms for Several Polynomials...
Fast Parallel Gcd Algorithms for Several Polynomials Over Integral Domain (Classic Reprint) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
- PublisherForgotten Books
- Publication date2024
- ISBN 10 1332127185
- ISBN 13 9781332127184
- BindingPaperback
- LanguageEnglish
- Number of pages32
Buy New
View this item
US$ 17.17
Shipping:
FREE
From United Kingdom to U.S.A.
Other Popular Editions of the Same Title
Search results for Fast Parallel Gcd Algorithms for Several Polynomials...
Seller Image
Fast Parallel Gcd Algorithms for Several Polynomials Over Integral Domain
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book presents a new parallel algorithm for computing the GCD of many polynomials over integral domains. It provides a fast and efficient way to solve this problem, which has applications in computer algebra, coding theory, and other areas of mathematics and computer science. The author extends the theory of subresultants from two polynomials to several polynomials, allowing for the efficient computation of the GCD of multiple polynomials simultaneously. This approach provides a deeper understanding of the relationship between the GCD and the subresultant chain, and it leads to a more efficient algorithm for computing the GCD. The book also discusses the practical implementation of the algorithm, including details on how to parallelize the computation and how to handle special cases. It provides a valuable resource for researchers and practitioners working in the area of polynomial GCD computation and related topics. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781332127184_0
Quantity: Over 20 available
Stock Image
Fast Parallel Gcd Algorithms for Several Polynomials Over Integral Domain Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781332127184
Quantity: 15 available
Stock Image
Fast Parallel Gcd Algorithms for Several Polynomials Over Integral Domain Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781332127184
Quantity: 15 available