Gauss: A Parameterized Domain of Computation System with Support for Signature Functions

The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substituting random numbers for variables, and mapping constants modulo p. This idea is exploited in specific algorithms in computer algebra systems, e.g. algorithms for polynomial greatest common divisors. It is also used as a heuristic to speed up other calculations. But none exploit it in a systematic manner. The goal of this work was twofold. First, to design an AXIOM like system in which these signature functions can be constructed automatically, hence better exploited, and secondly, to exploit them in new ways. In this paper we report on the design of such a system, Gauss.

• Type: Conference
• Year: 1993
• Where: DISCO
• Authors: Michael B. Monagan
• Keywords: Applied Computing, DISCO 1993, Integers Modulo P, Modulo P, Signature Functions