Census algorithms for chinese remainder pseudorank

DOI10.1051/ita:2007024zbMath1141.11324OpenAlexW2131652836MaRDI QIDQ3515464

David Laing, Bruce Litow

Publication date: 29 July 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92873

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Computational number theory (11Y99)

Related Items (1)

Census algorithms for chinese remainder pseudorank

Cites Work

• Semidefinite programming and arithmetic circuit evaluation
• Division in logspace-uniformNC¹
• Modular exponentiation via the explicit Chinese remainder theorem
• Census algorithms for chinese remainder pseudorank
• Fast Parallel Arithmetic via Modular Representation
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Census algorithms for chinese remainder pseudorank