scientific article; zbMATH DE number 18647

zbMATH Open0769.11050MaRDI QIDQ3976052FDOQ3976052

Authors: Thomas Zeugmann 

Publication date: 26 June 1992

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

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

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)

Cited In (9)

• The parallel complexity of exponentiating polynomials over finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Very Fast Parallel Polynomial Arithmetic
• Massively parallel computations on many-variable polynomials
• Title not available (Why is that?)
• Modular exponentiation via the explicit Chinese remainder theorem
• Computing Powers in Parallel

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)