Related Books

Using an efficient sparse minor expansion algorithm to compute polynomial subresultants and GCD.
Language: en
Pages: 32
Authors: University of Utah. Dept. of Computer Science
Categories: Algorithms
Type: BOOK - Published: 1977 - Publisher:

GET EBOOK

EUROSAM 84
Language: en
Pages: 412
Authors: John Fitch
Categories: Computers
Type: BOOK - Published: 1984-06 - Publisher: Springer Science & Business Media

GET EBOOK

Efficient Algorithms for Computations with Sparse Polynomials
Language: en
Pages: 252
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
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
Sparse Polynomial Interpolation and the Fast Euclidean Algorithm
Language: en
Pages: 152
Authors: Soo Go
Categories: Euclidean algorithm
Type: BOOK - Published: 2012 - Publisher:

GET EBOOK

We introduce an algorithm to interpolate sparse multivariate polynomials with integer coefficients. Our algorithm modifies Ben-Or and Tiwari's deterministic alg