Fast Arithmetics Using Chinese Remaindering

Simple item page
dc.creatorDavida, George
dc.creatorLitow, Bruce
dc.creatorXu, Guangwu
dc.date2008-06-10
dc.date.accessioned2026-07-07T09:43:38Z
dc.date.available2026-07-07T09:43:38Z
dc.descriptionIn this paper, some issues concerning the Chinese remaindering representation are discussed. Some new converting methods, including an efficient probabilistic algorithm based on a recent result of von zur Gathen and Shparlinski \cite{Gathen-Shparlinski}, are described. An efficient refinement of the NC$^1$ division algorithm of Chiu, Davida and Litow \cite{Chiu-Davida-Litow} is given, where the number of moduli is reduced by a factor of $\log n$.
dc.identifierhttps://arxiv.org/abs/0806.1722
dc.identifierhttp://arxiv.org/abs/0806.1722
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162630
dc.subjectData Structures and Algorithms
dc.subjectG.1.0
dc.titleFast Arithmetics Using Chinese Remaindering
dc.typetext

Files

Collections

arXiv