利用汉语余数的快速算法
Fast Arithmetics Using Chinese Remaindering
摘要：
本文讨论了有关汉语拼音表示的若干问题。介绍了一些新的转换方法，包括基于von zur Gathen和Shparlinski \cite{Gathen-Shparlinski}最近结果的一种有效的概率算法。对Chiu，Davida和Litow的NC $^1$除法算法\cite{Chiu-Davida-Litow}给出了一个有效的改进，其中模的数目减少了$\log n$ .
英文摘要：
In 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$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
