Census algorithms for chinese remainder pseudorank

DOI10.1051/ITA:2007024zbMATH Open1141.11324OpenAlexW2131652836MaRDI QIDQ3515464FDOQ3515464

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
• Title not available (Why is that?)
• Division in logspace-uniform NC
• Fast Parallel Arithmetic via Modular Representation
• Semidefinite programming and arithmetic circuit evaluation
• Modular exponentiation via the explicit Chinese remainder theorem
• Census algorithms for chinese remainder pseudorank

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)