26 search results - page 5 / 6 » issac 2004 |
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
There exist sound literature and algorithms for computing Liouvillian solutions for the important problem of linear ODEs with rational coefficients. Taking as sample the 363 secon...
ISSAC
2011
Springer
12 years 8 months ago
2011
Springer
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
We present a streamlined and refined version of Karr’s summation algorithm. Karr’s original approach constructively decides the telescoping problem in ΠΣ-fields, a very ge...
ISSAC
2004
Springer
13 years 10 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...