ISSAC
1998
Springer
13 years 11 months ago
1998
Springer
This note presents a new algorithm for the computation of the set of normal subgroups of a finite group. It is based on lifting via homomorphic images.
ISSAC
1998
Springer
13 years 11 months ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
ISSAC
1998
Springer
13 years 11 months ago
1998
Springer
In this paper we demonstrate the use of formal methods tools to provide a semantics for the type hierarchy of the AXIOM computer algebra system, and a methodology for Aldor progra...
ISSAC
1998
Springer
13 years 11 months ago
1998
Springer
ADG
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
ADG
1998
Springer
13 years 11 months ago
1998
Springer
This paper reviews and evaluates three main techniques for automated geometry diagram construction: synthetic methods, numerical computation methods, and symbolic computation metho...
ISSAC
1999
Springer
13 years 11 months ago
1999
Springer
Mathematical computing can become easily accessible and conveniently usable on the Internet. The distributed Internet Accessible Mathematical Computation (IAMC) system can supply ...
ISSAC
1999
Springer
13 years 11 months ago
1999
Springer
ISSAC
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we consider the problem of fast computation of n-ary products, for large n, over arbitrary precision integer or rational number domains. The combination of loop unro...
ISSAC
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...