scientific article; zbMATH DE number 18647

MaRDI QIDQ3976052zbMATHFDO

Authors Thomas Zeugmann

Publication date 26 June 1992

zbMATH Keywords

finite fieldspolynomial computationsfast parallel algorithmslarge polynomial powers

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Distributed algorithms (68W15) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Publication:4207582
• Highly parallel computations modulo a number having only small prime factors
• Computing Powers in Parallel
• Very Fast Parallel Polynomial Arithmetic
• Publication:4725742

Cited in

(9)

• Modular exponentiation via the explicit Chinese remainder theorem
• Very Fast Parallel Polynomial Arithmetic
• The parallel complexity of exponentiating polynomials over finite fields
• scientific article; zbMATH DE number 4128395 (Why is no real title available?)
• Computing Powers in Parallel
• scientific article; zbMATH DE number 5627530 (Why is no real title available?)
• scientific article; zbMATH DE number 3999284 (Why is no real title available?)
• Massively parallel computations on many-variable polynomials
• scientific article; zbMATH DE number 4062581 (Why is no real title available?)

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