Sciweavers

ISSAC
1992
Springer
114views Mathematics» more  ISSAC 1992»
13 years 10 months ago
Parallel Lattice Basis Reduction
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
Gilles Villard
ISSAC
1992
Springer
101views Mathematics» more  ISSAC 1992»
13 years 10 months ago
Homogeneous Decomposition of Polynomials
Jürgen Weiss
ISSAC
1992
Springer
95views Mathematics» more  ISSAC 1992»
13 years 10 months ago
Real Algebraic Closure of an Ordered Field: Implementation in Axiom
Real algebraic numbers appear in many Computer Algebra pro bJems. For inst ante the determination of a cylindrical algebraic decomposition for an euclidian space requires compu ti...
Renaud Rioboo
ISSAC
1992
Springer
109views Mathematics» more  ISSAC 1992»
13 years 10 months ago
Easy Numbers for the Elliptic Curve Primality Proving Algorithm
We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm than average numbers. It is shown that this is the...
François Morain
ISSAC
1992
Springer
105views Mathematics» more  ISSAC 1992»
13 years 10 months ago
Solving Parametric Algebraic Systems
For a parametric polynomial system: p1 = 0,
Xiao-Shan Gao, Shang-Ching Chou
ISSAC
1994
Springer
80views Mathematics» more  ISSAC 1994»
13 years 10 months ago
A First Report on the A# Compiler
Stephen M. Watt, Peter A. Broadbery, Samuel S. Doo...
ISSAC
1994
Springer
96views Mathematics» more  ISSAC 1994»
13 years 10 months ago
Automating the Construction of Stationary Multiple-Point Classes
In this paper, we describe an algorithm to compute arbitrary stationary multiple-point formulas. We report its full implementation in Maple and show some examples matching formula...
Sylvain Petitjean