Hostname: page-component-74656f9884-rdgjk Total loading time: 0 Render date: 2026-11-09T12:38:35.043Z Has data issue: false hasContentIssue false
  • English
  • Français

Census algorithms for chinese remainder pseudorank

Published online by Cambridge University Press:  14 August 2007

David Laing  and
Bruce Litow
David Laing
Affiliation:
School of Information Technology, James Cook University, Townsville, Qld. 4811, Australia; bruce@cs.jcu.edu.au; david.laing1@jcu.edu.au
Bruce Litow
Affiliation:
School of Information Technology, James Cook University, Townsville, Qld. 4811, Australia; bruce@cs.jcu.edu.au; david.laing1@jcu.edu.au
Get access

Abstract

We investigate the density and distribution behaviors of the chinese remainder representationpseudorank. We give a very strong approximation to density, and derive two efficientalgorithms to carry out an exact count (census) of the bad pseudorank integers. One ofthese algorithms has been implemented, giving results in excellent agreement withour density analysis out to 5189-bit integers.

Keywords

Chinese remainder representationrankpseudorankpseudorank census algorithms

Information

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 42 , Issue 2 , April 2008 , pp. 309 - 322
Copyright
© EDP Sciences, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Bernstein, D.J. and Sorenson, J., Modular exponentiation via the explicit chinese remainder theorem. Math. Comp. 76 (2007) 443–454. CrossRef
Chiu, A., Davida, G. and Litow, B., Division in logspace-uniform NC1. RAIRO-Theor. Inf. Appl. 35 (2001) 259–275. CrossRef
Davida, G. and Litow, B., Fast parallel arithmetic via modular representation. SIAM J. Comput. 20 (1991) 756–765. CrossRef
Dusart, P., The kth prime is greater than k(lnk - lnlnk - 1) for k ≥ 2. Math. Comp. 68 (1999) 411–415. CrossRef
G.H. Hardy and E.M.Wright, An Introduction to the Theory of Numbers. Oxford Press, USA (1979).
D. Knuth, The Art of Computer Programming, Vol. II. Addison-Wesley (1969).
W. Kuich and A. Salomaa, Semirings, Automata, Languages. Springer-Verlag (1986).
B. Litow and D. Laing, A census algorithm for chinese remainder pseudorank with experimental results. Technical Report. http://www.it.jcu.edu.au/ftp/pub/techreports/2005-3.pdf
A. Salomaa and S. Soittola, Automata Theoretic Aspects of Formal Power Series. Springer-Verlag (1978).
S.P. Tarasov and M.N. Vyalyi, Semidefinite programming and arithmetic circuit evaluation. Technical report, arXiv:cs.CC/0512035 v1 9 Dec 2005 (2005).
I.M. Vinogradov, Elements of Number Theory. Dover (1954).