scientific article; zbMATH DE number 15442

zbMATH Open0797.68088MaRDI QIDQ3972078FDOQ3972078

Authors: Willard L. Eastman 

Publication date: 25 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• Systolic VLSI Arrays for Polynomial GCD Computation
• A systolic algorithm for extended GCD computation
• Publication:3468614
• Analysis of Euclidean algorithms for polynomials over finite fields
• An Iterative Euclidean Algorithm

zbMATH Keywords

greatest common divisorpolynomial divisionVLSI implementationEuclid's algorithm

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Polynomials (irreducibility, etc.) (11R09) Number-theoretic algorithms; complexity (11Y16) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cited In (8)

• Computing the modular inverses is as simple as computing the GCDs
• An Iterative Euclidean Algorithm
• Title not available (Why is that?)
• Systolic VLSI Arrays for Polynomial GCD Computation
• Dancing elves and a flower’s view of euclid’s algorithm
• An improvement of Euclid's algorithm.
• Partial realization and the Euclidean algorithm
• Euclid's algorithm as a computational tool in the mathematics of antiquity.

This page was built for publication:

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