An algorithm for the chinese remainder problem

DOI10.1080/00207169708804586zbMATH Open0912.11058OpenAlexW1970029156MaRDI QIDQ4384036FDOQ4384036

Authors:

Publication date: 30 May 1999

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169708804586

zbMATH Keywords

algorithmsChinese remainder problem

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: An algorithm for the chinese remainder problem

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