scientific article; zbMATH DE number 4135405

MaRDI QIDQ3468614zbMATH OpenFDO

Authors Juraj Procházka

Publication date 1990

zbMATH Keywords

computational complexitypolynomial GCD computationsystolic systems

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09) Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80)

Recommendations

• Systolic VLSI Arrays for Polynomial GCD Computation
• A systolic algorithm for extended GCD computation
• Parallel algorithms on greatest common divisor of polynomial system
• Circuits for computing the GCD of two polynomials over an algebraic number field
• Systolic algorithm for polynomial interpolation and related problems

Cited in

(6)

• A systolic algorithm for extended GCD computation
• Systolic computation of interpolating polynomials
• Systolic VLSI Arrays for Polynomial GCD Computation
• Functional–Based Synthesis of a Systolic Array for GCD Computation
• scientific article; zbMATH DE number 15442 (Why is no real title available?)
• Polynomial multiplication on systolic arrays

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 Q3468614)