COMPGEOM
2011
ACM
13 years 2 months ago
2011
ACM
We report on a generic uni- and bivariate algebraic kernel that is publicly available with Cgal 3.7. It comprises complete, correct, though efficient state-of-the-art implementati...
MOC
2002
13 years 10 months ago
2002
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running ti...
ADCM
2008
13 years 11 months ago
2008
In this paper we present a complete description of ideal projectors from the space of bivariate polynomials F[x; y] onto its subspace F<n[x; y] of polynomials of degree less tha...
ISSAC
1997
Springer
14 years 3 months ago
1997
Springer
We give a new numerical absolute primality criterion for bivariate polynomials. This test is based on a simple property of the monomials appearing after a generic linear change of...
ISSAC
2004
Springer
14 years 4 months ago
2004
Springer
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
EUROCRYPT
2005
Springer
14 years 4 months ago
2005
Springer
We present a new and flexible formulation of Coppersmith’s method for finding small solutions of bivariate polynomials p(x, y) over the integers. Our approach allows to maximiz...
CASC
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...