Sparse Modular GCD Algorithm for Polynomials Over Algebraic Function Fields

Sparse Modular GCD Algorithm for Polynomials Over Algebraic Function Fields
Author :
Publisher :
Total Pages : 70
Release :
ISBN-10 : 0494294418
ISBN-13 : 9780494294413
Rating : 4/5 (413 Downloads)
GET BOOK
Book Synopsis Sparse Modular GCD Algorithm for Polynomials Over Algebraic Function Fields by : Seyed Mohammad Mahdi Javadi

Download or read book Sparse Modular GCD Algorithm for Polynomials Over Algebraic Function Fields written by Seyed Mohammad Mahdi Javadi and published by . This book was released on 2006 with total page 70 pages. Available in PDF, EPUB and Kindle. Book excerpt: Keywords. Modular Algorithms, Zippel's Sparse Interpolation Algorithm, Polynomial Greatest Common Divisors.


Sparse Modular GCD Algorithm for Polynomials Over Algebraic Function Fields Related Books

Sparse Modular GCD Algorithm for Polynomials Over Algebraic Function Fields
Language: en
Pages: 70

Sparse Modular GCD Algorithm for Polynomials Over Algebraic Function Fields

Authors: Seyed Mohammad Mahdi Javadi
Categories: Algebra
Type: BOOK - Published: 2006 - Publisher:

GET EBOOK

Keywords. Modular Algorithms, Zippel's Sparse Interpolation Algorithm, Polynomial Greatest Common Divisors.
Efficient Algorithms for Computations with Sparse Polynomials
Language: en
Pages: 252

Efficient Algorithms for Computations with Sparse Polynomials

Authors: Seyed Mohammad Mahdi Javadi
Categories: Computational complexity
Type: BOOK - Published: 2011 - Publisher:

GET EBOOK

The problem of interpolating a sparse polynomial has always been one of the central objects of research in the area of computer algebra. It is the key part of m
Computing Polynomial Greatest Common Divisors Using Sparse Interpolation
Language: en
Pages: 146

Computing Polynomial Greatest Common Divisors Using Sparse Interpolation

Authors: Jiaxiong Hu
Categories:
Type: BOOK - Published: 2018 - Publisher:

GET EBOOK

Computing polynomial greatest common divisors (GCD) plays an important role in Computer Algebra systems because the GCD operation is the bottleneck of many basi
Effective Polynomial Computation
Language: en
Pages: 386

Effective Polynomial Computation

Authors: Richard Zippel
Categories: Computers
Type: BOOK - Published: 1993-07-31 - Publisher: Springer Science & Business Media

GET EBOOK

Effective Polynomial Computation is an introduction to the algorithms of computer algebra. It discusses the basic algorithms for manipulating polynomials includ
Algorithms for Polynomials Over a Real Algebraic Number Field
Language: en
Pages: 484

Algorithms for Polynomials Over a Real Algebraic Number Field

Authors: Cyrenus Matthew Rubald
Categories: Algorithms
Type: BOOK - Published: 1973 - Publisher:

GET EBOOK