Highly parallel computations modulo a number having only small prime factors

DOI10.1016/0890-5401(92)90057-MzbMath0768.68031MaRDI QIDQ1184734

Thomas Zeugmann

Publication date: 28 June 1992

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

inversehighly parallel algorithmsdiscrete rootslarge powersmall prime factorsuniform families of Boolean circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A taxonomy of problems with fast parallel algorithms
• Hensel and Newton Methods in Valuation Rings
• Logarithmic Depth Circuits for Algebraic Functions
• Log Depth Circuits for Division and Related Problems
• Computing Powers in Parallel
• On Relating Time and Space to Size and Depth

This page was built for publication: Highly parallel computations modulo a number having only small prime factors