Another polynomial homomorphism

DOI10.1007/BF00268498zbMATH Open0312.68024MaRDI QIDQ1219683FDOQ1219683

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

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

Cited In (2)

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

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)