152
click to vote
ISSAC
15 years 6 months ago
1995 Springer 
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...
131
click to vote
ISSAC
15 years 6 months ago
1995 Springer 
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
129
click to vote
ISSAC
15 years 6 months ago
1995 Springer 
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
123
click to vote
ISSAC
15 years 6 months ago
1995 Springer 
Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes it is desired to produce results for ...
116
click to vote
ISSAC
15 years 6 months ago
1995 Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
|
Mathematics