Crossmark

The Complexity of a Pipelined Algorithm for Remainder Computing in a Given Modulo

Crossref DOI link: https://doi.org/10.3103/S0146411618040120

Published Online: 2018-09-20

Published Print: 2018-07

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Zakharov, V. M.

Pesoshin, V. A.

Shalagin, S. V.
License Information

Text and Data Mining valid from 2018-07-01
More Information

Article History

Received: 26 September 2017

Accepted: 8 April 2018

First Online: 20 September 2018