5128 search results - page 246 / 1026 » When Abstraction Fails |
155
click to vote
AAECC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefficients in a perfect field when those ideals are generate...
219
click to vote
COLING
2002
15 years 7 months ago
2002
tion. Our method was developed through the study of a corpus of abstracts written ssional abstractors. Relying on human judgment, we have evaluated indicativeness, informativeness,...
155
click to vote
MOC
2000
15 years 7 months ago
2000
Abstract. The main problem when solving a Thue equation is the computation of the unit group of a certain number field. In this paper we show that the knowledge of a subgroup of fi...
147
click to vote
MOC
1998
15 years 7 months ago
1998
Abstract. We present formulations of the Trotter-Kato theorem for approximation of linear C0-semigroups which provide very useful framework when convergence of numerical approximat...
216
click to vote
MOC
1998
15 years 7 months ago
1998
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...