Dataset of test data (Tables 1–3) used in the paper: Akira Terui, GPGCD: An iterative method for calculating approximate GCD of univariate polynomials. Theoretical Computer Science, Volume 479 (Symbolic-Numerical Algorithms), April 2013, 127-149. doi:10.1016/j.tcs.2012.10.023 arXiv:1207.063
A heuristic algorithm, GCDHEU, is described for polynomial GCD computation over the integers. The al...
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a c...
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univa...
AbstractWe study the approximate GCD of two univariate polynomials given with limited accuracy or, e...
We implemented the approximate GCD algorithm [KYZ06] in our LIBSNAP library, and did a couple of per...
summary:The computation of polynomial greatest common divisor (GCD) ranks among basic algebraic prob...
The computation of polynomial greatest common divisors (GCDs) is a fundamental problem in algebraic...
We present an iterative algorithm for calculating approxi-mate greatest common divisor (GCD) of univ...
AbstractWe study the approximate GCD of two univariate polynomials given with limited accuracy or, e...
Title: Approximate Polynomial Greatest Common Divisor Author: Ján Eliaš Department: Department of Nu...
AbstractThree new algorithms for multivariate polynomial GCD (greatest common divisor) are given. Th...
Title: Approximate Polynomial Greatest Common Divisor Author: Ján Eliaš Department: Department of Nu...
我々はこれまでに, 1変数多項式に対する近似GCD計算の反復算法であるGPGCDアルゴリズムを提案している. 本稿では, オリジナルのGPGCDアルゴリズムに用いたSylvesterの終結式行列に代え...
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest ...
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a c...
A heuristic algorithm, GCDHEU, is described for polynomial GCD computation over the integers. The al...
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a c...
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univa...
AbstractWe study the approximate GCD of two univariate polynomials given with limited accuracy or, e...
We implemented the approximate GCD algorithm [KYZ06] in our LIBSNAP library, and did a couple of per...
summary:The computation of polynomial greatest common divisor (GCD) ranks among basic algebraic prob...
The computation of polynomial greatest common divisors (GCDs) is a fundamental problem in algebraic...
We present an iterative algorithm for calculating approxi-mate greatest common divisor (GCD) of univ...
AbstractWe study the approximate GCD of two univariate polynomials given with limited accuracy or, e...
Title: Approximate Polynomial Greatest Common Divisor Author: Ján Eliaš Department: Department of Nu...
AbstractThree new algorithms for multivariate polynomial GCD (greatest common divisor) are given. Th...
Title: Approximate Polynomial Greatest Common Divisor Author: Ján Eliaš Department: Department of Nu...
我々はこれまでに, 1変数多項式に対する近似GCD計算の反復算法であるGPGCDアルゴリズムを提案している. 本稿では, オリジナルのGPGCDアルゴリズムに用いたSylvesterの終結式行列に代え...
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest ...
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a c...
A heuristic algorithm, GCDHEU, is described for polynomial GCD computation over the integers. The al...
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a c...
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univa...
DOI
Add to ORKG