z-logo
open-access-imgOpen Access
Implementing the Thull-Yap Algorithm for Computing Euclidean Remainder Sequences
Author(s) -
François Morain
Publication year - 2022
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/3476446.3536188
Subject(s) - remainder , euclidean algorithm , algorithm , chinese remainder theorem , sequence (biology) , focus (optics) , computer science , integer (computer science) , euclidean geometry , mathematics , discrete mathematics , theoretical computer science , arithmetic , physics , geometry , biology , optics , genetics , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom