Bits and relative order from residues, space efficiently

For each k, let P k be the product of the first k primes. Each integer in the interval [0, P k ) is determined by its residues modulo these k primes. We address the problems of space-efficiently computing the bits and the relative order of such numbers from their residues.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters 1994-05, Vol.50 (3), p.123-127
Hauptverfasser:	Dietz, Paul F., Macarie, Ioan I., Seiferas, Joel I.
Format:	Artikel
Sprache:	eng
Schlagworte:	Binary representation Chinese remainder theorem Computational complexity Computer programming Information processing Mathematical analysis Parity detection Residue number system Sign detection Space complexity Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	For each k, let P k be the product of the first k primes. Each integer in the interval [0, P k ) is determined by its residues modulo these k primes. We address the problems of space-efficiently computing the bits and the relative order of such numbers from their residues.
ISSN:	0020-0190 1872-6119
DOI:	10.1016/0020-0190(94)00021-2