期刊文献+

Fast Arithmetics Using Chinese Remaindering

Fast Arithmetics Using Chinese Remaindering
下载PDF
导出
摘要 In this paper,some issues concerning the Chinese remaindering representation are discussed.A new converting method is described. An efficient refinement of the division algorithm of Chiu,Davida and Litow is given. In this paper,some issues concerning the Chinese remaindering representation are discussed.A new converting method is described. An efficient refinement of the division algorithm of Chiu,Davida and Litow is given.
出处 《China Communications》 SCIE CSCD 2007年第4期45-47,共3页 中国通信(英文版)
  • 相关文献

参考文献6

  • 1D.Bernstein,J.Sorenson.Modular exponentiation via the explicit Chinese Remainder Theorem[].Mathematics of Computation.
  • 2G.Davida,B.Litow.Fast Parallel Arithmetic via Modular Repre-sentation[].SIAM Journal on Computing.1991
  • 3M.Hitz,E.Kaltofen.Integer division in residue number systems[].IEEE Transactions on Computers.1995
  • 4Beame,P. W.,Cook,S. A.,Hoover,H. J.Log depth circuits for division and related problems[].SIAM Journal on Computing.1986
  • 5A. Chiu,G. Davida,B. Litow.Division in logspace-uniform NC 1[].Theor Inform Appl.2001
  • 6Knuth,D. The Art of Computer Programming, Volume 3, Sorting and Searching . 1997

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部