ISSAC 1999 | Sciweavers

11

ISSAC
1999
Springer

136views Mathematics» more ISSAC 1999»

Design and Protocol for Internet Accessible Mathematical Computation

13 years 8 months ago

Mathematical computing can become easily accessible and conveniently usable on the Internet. The distributed Internet Accessible Mathematical Computation (IAMC) system can supply ...

Paul S. Wang

claim paper

Read More »

14

click to vote

ISSAC
1999
Springer

138views Mathematics» more ISSAC 1999»

Commutativity Theorems: Examples in Search of Algorithms

13 years 8 months ago

Download math.ucsd.edu

John J. Wavrik

claim paper

Read More »

8

click to vote

ISSAC
1999
Springer

86views Mathematics» more ISSAC 1999»

How Fast Can We Compute Products?

13 years 8 months ago

Download www.cybertester.com

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...

V. Kislenkov, V. Mitrofanov, Eugene V. Zima

claim paper

Read More »

8

click to vote

ISSAC
1999
Springer

116views Mathematics» more ISSAC 1999»

On the Genericity of the Modular Polynomial GCD Algorithm

13 years 8 months ago

Download www4.ncsu.edu

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 ...

Erich Kaltofen, Michael B. Monagan

claim paper

Read More »

8

click to vote

ISSAC
1999
Springer

127views Mathematics» more ISSAC 1999»

Approximate polynomial decomposition

13 years 8 months ago