Census algorithms for chinese remainder pseudorank

DOI10.1051/ITA:2007024MaRDI QIDQ3515464zbMATH OpenOpenAlexFDO

Authors 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, https://semanticscholar.org/paper/9d470be2d3e2d68c0210c7ca7561f1549e784bc9

Mathematics Subject Classification ID

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

Recommendations

• Fast evaluation of iterated multiplication of very large polynomials: an application to Chinese remainder theory
• Fast arithmetics using Chinese remaindering
• Chinese remaindering with errors
• Chinese remaindering with errors
• scientific article; zbMATH DE number 17620

Cites work

• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• scientific article; zbMATH DE number 3091928 (Why is no real title available?)
• Census algorithms for chinese remainder pseudorank
• Division in logspace-uniform NC
• Fast Parallel Arithmetic via Modular Representation
• Modular exponentiation via the explicit Chinese remainder theorem
• Semidefinite programming and arithmetic circuit evaluation
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2

Cited in

(2)

• Fast evaluation of iterated multiplication of very large polynomials: an application to Chinese remainder theory
• Census algorithms for chinese remainder pseudorank

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3515464)