On computation of the greatest common divisor of several polynomials over a finite field.

DOI10.1016/S1071-5797(03)00022-4zbMath1080.11084MaRDI QIDQ1414018

Alessandro Conflitti

Publication date: 19 November 2003

Published in: Finite Fields and their Applications (Search for Journal in Brave)

zbMATH Keywords

greatest common divisorprobabilistic algorithmpolynomials over finite fields

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (1)

Efficient \(q\)-integer linear decomposition of multivariate polynomials

Cites Work

• Certified dense linear system solving
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On computation of the greatest common divisor of several polynomials over a finite field.