Fast arithmetics using Chinese remaindering

DOI10.1016/j.ipl.2009.02.024zbMath1215.68268arXiv0806.1722OpenAlexW1972292206MaRDI QIDQ989447

Guangwu Xu, Bruce Litow, George Davida

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0806.1722

zbMATH Keywords

parallel algorithmChinese remaindering representation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (2)

A randomized sublinear time parallel GCD algorithm for the EREW PRAM ⋮ On Solving a Generalized Chinese Remainder Theorem in the Presence of Remainder Errors

Cites Work

• Unnamed Item
• Unnamed Item
• GCD of random linear combinations
• Division in logspace-uniformNC¹
• Log Depth Circuits for Division and Related Problems
• Fast Parallel Arithmetic via Modular Representation
• Integer division in residue number systems

This page was built for publication: Fast arithmetics using Chinese remaindering