Re: Modulo n arithmetics

"David R. Clark" <drclark@daisy.uwaterloo.ca>
Wed, 11 Nov 1992 13:17:03 GMT

          From comp.compilers
Related articles
Modulo n arithmetics fabre@gr.osf.org (Christian Fabre) (1992-11-06)
Re: Modulo n arithmetics pardo@cs.washington.edu (1992-11-10)
Re: Modulo n arithmetics drclark@daisy.uwaterloo.ca (David R. Clark) (1992-11-11)
Re: Modulo n arithmetics dneedham@oucsace.cs.ohiou.edu (1992-11-11)
Modulo n arithmetics wchsieh@beethoven.lcs.mit.edu (1992-11-11)
Re: Modulo n arithmetics wendt@CS.ColoState.EDU (1992-11-15)
Re: Modulo n arithmetics johnr@ee.uts.edu.au (1992-11-17)
Re: Modulo n arithmetics chris@gargoyle.uchicago.edu (1992-11-19)
Re: Modulo n arithmetics tve@crackle.CS.Berkeley.EDU (1992-11-20)
[1 later articles]
| List of all articles for this month |
Newsgroups: comp.compilers
From: "David R. Clark" <drclark@daisy.uwaterloo.ca>
Organization: Compilers Central
Date: Wed, 11 Nov 1992 13:17:03 GMT
Keywords: arithmetic
References: 92-11-029

Math mod a prime is used extensively in symbolic computations. Problems
are typically solved over Z mod p and then "lifted" using a Chinese
Remaindering approach to obtain the full solution. These methods often
require arbitrary precision math but even that may use modular operations.
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.