@article{Abramov:2005aa,
Abstract = {We present some algorithms related to rings of Ore polynomials (or, briefly, Ore rings) and describe a computer algebra library for basic operations in an arbitrary Ore ring. The library can be used as a basis for various algorithms in Ore rings, in particular, in differential, shift, and q-shift rings.},
Author = {Abramov, S. A. and Le, H. Q. and Li, Z.},
File = {Univariate Ore Polynomial Rings in Computer Algebra - Abramov2005\_Article\_UnivariateOrePolynomialRingsIn - a - m.pdf},
ISBN = {1573-8795},
Journal = {Journal of Mathematical Sciences},
Number = {5},
Pages = {5885--5903},
Title = {Univariate Ore Polynomial Rings in Computer Algebra},
URL = {https://doi.org/10.1007/s10958-005-0449-8},
Volume = {131},
Year = {2005},
bdsk-url-1 = {https://doi.org/10.1007/s10958-005-0449-8},
da = {2005/12/01},
date-added = {2020-04-27 07:22:46 +0200},
date-modified = {2020-04-27 07:22:46 +0200},
id = {Abramov2005},
ty = {JOUR},
doi = {10.1007/s10958-005-0449-8}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A