• Cite Icon77
  • https://doi.org/10.1145/800192.805698Copy DOI Icon

The EZ GCD algorithm

  • Jan 1, 1973
  • Joel Moses +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper presents a preliminary report on a new algorithm for computing the Greatest Common Divisor (GCD) of two multivariate polynomials over the integers. The algorithm is strongly influenced by the method used for factoring multivariate polynomials over the integers. It uses an extension of the Hensel lemma approach originally suggested by Zassenhaus for factoring univariate polynomials over the integers. We point out that the cost of the Modular GCD algorithm applied to sparse multivariate polynomials grows at least exponentially in the number of variables appearing in the GCD. This growth is largely independent of the number of terms in the GCD. The new algorithm, called the EZ (Extended Zassenhaus) GCD Algorithm, appears to have a computing bound which in most cases is a polynomial function of the number of terms in the original polynomials and the sum of the degrees of the variables in them. Especially difficult cases for the EZ GCD Algorithm are described. Applications of the algorithm to the computation of contents and square-free decompositions of polynomials are indicated.

Similar Papers
  • Research Article
  • Citations5

Speeding up Euclid's GCD algorithm with no magnitude comparisons

  • Jan 01, 2010
  • International Journal of Information and Computer Security
  • Che Wun Chiou +2
  • Research Article
  • Citations2

New Modified Euclidean and Binary Greatest Common Divisor Algorithm

  • Sep 07, 2016
  • IETE Journal of Research
  • Jitendra V Tembhurne +1
  • Conference Article

Blind deconvolution of blurred images from multiple observations using the GCD algorithm

  • Mar 27, 2001
  • M.M Hadhoud +3
  • Research Article
  • Citations1

Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation

  • Jul 15, 2024
  • Journal of Symbolic Computation
  • Kosaku Nagasaka
  • Conference Article
  • Citations4

An extended GCD algorithm for parametric univariate polynomials and application to parametric smith normal form

  • Jul 20, 2020
  • Dingkang Wang +2
  • Conference Article
  • Citations4

VLSI array synthesis for polynomial GCD computation

  • Dec 30, 2002
  • Y Jeong +1
  • Research Article
  • Citations129

Greatest common divisors of polynomials given by straight-line programs

  • Jan 01, 1988
  • Journal of the ACM
  • Erich Kaltofen
  • PDF
  • Research Article
  • Citations1

On a new algorithm for computing GCD of integer numbers

  • Jul 06, 2020
  • Trends in Computer Science and Information Technology
  • Ishmukhametov St +3
  • Book Chapter
  • Citations8

Unique Factorization Domains in the Java Computer Algebra System

  • Jan 01, 2011
  • Heinz Kredel
  • Conference Article
  • Citations8

Blind image deconvolution using a robust 2-D GCD approach

  • Jun 09, 1997
  • Ben Liang +1
  • Conference Article
  • Citations6

A redundant binary Euclidean GCD algorithm

  • Jun 26, 1991
  • S.N Parikh +1
  • Research Article

Bit complexity of polynomial GCD on sparse representation

  • Feb 03, 2025
  • Mathematics of Computation
  • Qiao-Long Huang +1
  • Research Article
  • Citations4

A Jacobi algorithm and metric theory for greatest common divisors

  • Jun 01, 1977
  • Journal of Mathematical Analysis and Applications
  • M.S Waterman
  • Research Article
  • Citations53

Blind image deconvolution using a robust GCD approach

  • Jan 01, 1999
  • IEEE Transactions on Image Processing
  • S Unnikrishna Pillai +1
  • Conference Article
  • Citations10

Modular Inverse for Integers using Fast Constant Time GCD Algorithm and its Applications

  • Aug 01, 2021
  • Sanjay Deshpande +5
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.