# In-place Arithmetic for Polynomials over Zn

@inproceedings{Monagan1993InplaceAF, title={In-place Arithmetic for Polynomials over Zn}, author={Michael B. Monagan}, year={1993} }

We present space and time efficient algorithms for univariate polynomial arithmetic operations over Z mod n where the modulus n does not necessarily fit into is not a machine word. These algorithms provide the key tools for the efficient implementation of polynomial resultant gcd and factorization computation over Z, without having to write large amounts of code in a systems implementation language. 1 B a c k g r o u n d This paper reports a solution to a dilema we faced during the design and… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 18 CITATIONS

## EFFICIENT ALGORITHMS FOR COMPUTATIONS WITH SPARSE POLYNOMIALS

VIEW 7 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## 2 Triangular Sets 2 . 1 Notation and Definitions

VIEW 1 EXCERPT

CITES BACKGROUND

## Resolving Zero Divisors Using Hensel Lifting

VIEW 1 EXCERPT

CITES BACKGROUND

## Resolving Zero-Divisors of Radical Triangular Sets Using Hensel Lifting and Applications

VIEW 1 EXCERPT

CITES METHODS

## A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions

VIEW 1 EXCERPT

CITES BACKGROUND

## A parallel implementation for polynomial multiplication modulo a prime

VIEW 1 EXCERPT

CITES METHODS

## Efficient Computation with Sparse and Dense Polynomials

VIEW 1 EXCERPT

## In-place Arithmetic for Univariate Polynomials over an Algebraic Number Field

VIEW 3 EXCERPTS

CITES METHODS

## Space- and time-efficient polynomial multiplication

VIEW 1 EXCERPT

CITES BACKGROUND

## Generic Linear Algebra and Quotient Rings in Maple

VIEW 3 EXCERPTS

CITES METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 21 REFERENCES

## A new modular algorithm for computation of algebraic number polynomial gcds

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## The Calculation of Multivariate Polynomial Resultants

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL

## Algorithms for computer algebra

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## The Art of Computer Programming Vol. 2: Seminumerical Algorithms (Second Edition)

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## A comparison of Maple V, Mathematica 1.2 and Macsyma 3.09 on a Sun 3/60

VIEW 1 EXCERPT

## Packing Circles in a Squaxe: A Review and New Results

VIEW 1 EXCERPT