122
Voted
ISSAC
15 years 5 months ago
2004 Springer 
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
82
Voted
ISSAC
15 years 5 months ago
2004 Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
111
Voted
ISSAC
15 years 5 months ago
2004 Springer 
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
ISSAC
15 years 5 months ago
2004 Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
85
Voted
ISSAC
15 years 5 months ago
2004 Springer |
Mathematics