Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2003

Highly Cited

2003

The problem of factoring a polynomial in a single or severalvariables over a finite field, the rational numbers or the… Expand

Is this relevant?

2002

2002

We describe algorithms for polynomial factorization over the binary field F2, and their implementation. They allow polynomials of… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

SINGULAR is a specialized computer algebra system for polynomial computations with emphasize on the needs of commutative algebra… Expand

Is this relevant?

1999

1999

xv Zusammenfassung xvii

Is this relevant?

Highly Cited

1992

Highly Cited

1992

A new probabilistic algorithm for factoring univariate polynomials over finite fields is presented. To factor a polynomial of… Expand

Is this relevant?

Highly Cited

1990

Highly Cited

1990

Algorithms are developed that adopt a novel implicit representation for multivariate polynomials and rational functions with… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

We present an algorithm to compute the primary decomposition of any ideal in a polynomialring over a factorially closed… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

An algorithm is developed for the factorization of a multivariate polynomial represented by a straight-line program into its… Expand

Is this relevant?

1984

1984

We show that the binary expansions of algebraic numbers do not form secure pseudorandom sequences; given sufficiently many… Expand

Is this relevant?

Highly Cited

1975

Highly Cited

1975

Abstract : This paper describes algorithms for factoring a polynomial in one or more variables, with integer coefficients, into… Expand

Is this relevant?