Fast Computation in Quotient Rings
Roman Pearce, CECM, SFU
Abstract: We will discuss the problem of computing in polynomial quotient rings and their fields of fractions. In particular, we will show how the normal form algorithm (which computes canonical forms for polynomials) can be sped up by at least an order of magnitude over its usual Maple implementation. We will also consider the problem of computing inverses when the quotient ring is a field.