Abstract
This paper presents an algorithm for evaluating an arithmetic expression over "big" rational numbers. The method exploits p-adic arithmetic and parallelism to achieve efficiency. Roughly, the algorithm begins by mapping the input rational numbers to the related p-adic codes for several prime bases, then the corresponding expression is evaluated over these codes and finally the rational output is recovered from the resulting codes. All these three steps are parallelized. An efficient algorithm to compute the recovery step is proposed. Let p be the maximum of the prime bases for the codes, let r be their truncation order and let k be the number of processors. The asymptotic bit-wise complexity of the proposed recovery step is O( r ( k log p) log 23 . The previous known bound was O( r 2( k log p) log 23 ). Let n be the number of operations in the given expression: the asymptotic bitwise complexity of the proposed algorithm for evaluating arithmetic expressions is O( n r 2 log p).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
