5510 search results - page 212 / 1102 » Mathematics |
103
click to vote
ISSAC
1998
Springer
15 years 8 months ago
1998
Springer
A technique to expedite iterative computations which is based on multidimensional chains of recurrences MCR is presented. Algorithms for MCR construction, interpretation and MCR-b...
112
click to vote
ISSAC
1998
Springer
15 years 8 months ago
1998
Springer
The subresultant theory for univariate commutative polynomials is generalized to Ore polynomials. The generalization includes: the subresultant theorem, gap structure, and subresu...
127
click to vote
MPC
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We present a description technique for the correct construction of programs that allows us to de ne terms like re nement, modelchecking, and synthesis as special operatio...
146
click to vote
ISSAC
1997
Springer
15 years 8 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
131
click to vote
ISSAC
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials over Z[t]. The subresultants of Ore polyn...