Polynomial greatest common divisor as a solution of system of linear equations

DOI10.1134/S1995080218070090zbMath1444.11006OpenAlexW2890926087WikidataQ129248954 ScholiaQ129248954MaRDI QIDQ1992108

Yanyan Li

Publication date: 2 November 2018

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080218070090

zbMATH Keywords

Euclidean algorithmsystem of linear equationspolynomial GCDgeneralized Schur algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials in number theory (11C08) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (2)

An extended Jebelean^ WeberNSedjelmaci GCD algorithm ⋮ Symmetric matrices whose entries are linear functions

Cites Work

• GCD calculation in the search task of pseudoprime and strong pseudoprime numbers
• A structured rank-revealing method for Sylvester matrix
• The accelerated integer GCD algorithm
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial greatest common divisor as a solution of system of linear equations