ISSAC
13 years 11 months 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 ...
ISSAC
13 years 11 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...
ISSAC
13 years 11 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
13 years 11 months 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,...
ISSAC
13 years 11 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...
|
Mathematics