ISBN: 9781332127184 - fast parallel gcd algorithms for several polynomials over integral domain (classic reprint) (3 resultados)

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condición: 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.…