203
click to vote
ISSAC
16 years 1 days 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...
199
click to vote
ISSAC
16 years 1 days ago
2004 Springer 
Simplification has been long recognised to be a fundamental problem within computer algebra[17]. However, even for the class of elementary functions, it has not been resolved in ...
194
click to vote
ISSAC
16 years 1 days ago
2004 Springer
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
176
click to vote
ISSAC
16 years 1 days 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...
174
click to vote
ISSAC
16 years 1 days ago
2004 Springer
Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...
|
Mathematics