We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
Abstract. The scope of the paper is animation facilities of computer algebra systems (CAS). Animation offers opportunities for visualization of complex mathematical concepts, provi...
In a present paper a problem of classification of Aff(2, R)orbits' dimensions is considered on example of an autonomous two-dimensional affine differential system of first or...
It is widely believed that mathematics will be one of the major applications for Tablet PCs and other pen-based devices. In this paper we discuss many of the issues that make doin...
George Labahn, Scott MacLean, Mirette S. Marzouk, ...
Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x=x becomes 1 dropping the case x = 0. We claim that it is feasible in practice to...
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
In this short communication we want to give an overview of how OpenMath is used in the European project “SCIEnce” [12]. The main aim of this project is to allow unified commun...
Computer Algebra Systems (CAS) provide sophisticated functionality to assist with mathematical problem solving. Despite their widespread adoption, however, little work in the HCI ...