Fast Parallel Gcd Algorithms for Several Polynomials Over Integral Domain (Classic Reprint) - Couverture souple
Synopsis
The digital edition of all books may be viewed on our website before purchase. Excerpt from Fast Parallel Gcd Algorithms for Several Polynomials Over Integral Domain
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books.
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 text has been digitally restored from a historical edition. Some errors may persist, however we consider it worth publishing due to the work's historical value.The digital edition of all books may be viewed on our website before purchase.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Fast Parallel Gcd Algorithms for Several Polynomials...
Image fournie par le vendeur
Fast Parallel Gcd Algorithms for Several Polynomials Over Integral Domain
impression à la demandeVendeur : Forgotten Books, London, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : 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. N° de réf. du vendeur 9781332127184_0
Acheter neuf
EUR 15,34
Livraison gratuite
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Fast Parallel Gcd Algorithms for Several Polynomials Over Integral Domain Classic Reprint
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332127184
Acheter neuf
EUR 21,78
Livraison gratuite
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 15 disponible(s)
Image d'archives
Fast Parallel Gcd Algorithms for Several Polynomials Over Integral Domain Classic Reprint
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332127184
Acheter neuf
EUR 24
Expédition à EUR 3,81
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : 15 disponible(s)