Census algorithms for chinese remainder pseudorank
Laing, David, and Litow, Bruce (2007) Census algorithms for chinese remainder pseudorank. RAIRO - Theoretical Informatics and Applications , 42 (2). pp. 309-322.
|PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
View at Publisher Website: http://dx.doi.org/10.1051/ita:2007024
We investigate the density and distribution behaviors of the chinese remainder representation pseudorank. We give a very strong approximation to density, and derive two efficient algorithms to carry out an exact count (census) of the bad pseudorank integers. One of these algorithms has been implemented, giving results in excellent agreement with our density analysis out to 5189-bit integers.
|Item Type:||Article (Refereed Research - C1)|
Reproduced with permission from EDP Sciences. RAIRO - Theoretical Informatics and Applications: http://www.rairo-ita.org
|Keywords:||Chinese remainder representation; rank; pseudorank; pseudorank census algorithms|
|FoR Codes:||08 INFORMATION AND COMPUTING SCIENCES > 0899 Other Information and Computing Sciences > 089999 Information and Computing Sciences not elsewhere classified @ 70%|
08 INFORMATION AND COMPUTING SCIENCES > 0802 Computation Theory and Mathematics > 080299 Computation Theory and Mathematics not elsewhere classified @ 30%
|SEO Codes:||97 EXPANDING KNOWLEDGE > 970101 Expanding Knowledge in the Mathematical Sciences @ 100%|
|Deposited On:||20 Jul 2009 14:43|
|Last Modified:||14 May 2013 00:25|
Last 12 Months: 15
|Citation Counts with External Providers:||Web of Science: 0|
Repository Staff Only: item control page