Another polynomial homomorphism

DOI10.1007/BF00268498MaRDI QIDQ1219683zbMATH OpenFDO

Authors R. Moenck

Publication date 1976

Published in Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cites work

• Algebra of Polynomials in Several Variables for a Digital Computer
• Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
• Fast computation of GCDs
• Fast modular transforms
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On Euclid's Algorithm and the Theory of Subresultants
• On the Efficiency of Algorithms for Polynomial Factoring
• Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments
• The Fast Fourier Transform in a Finite Field

Cited in

(2)

• Computing isomorphisms and embeddings of finite fields
• Polynomial bounds for invariant functions separating orbits

Describes a project that uses

Uses Software

• ALTRAN

This page was built for publication: Another polynomial homomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1219683)