On the complexity of skew arithmetic

In this paper, we study the complexity of several basic operations on linear differential operators with polynomial coefficients. As in the case of ordinary polynomials, we show that these complexities can be expressed almost linearly in terms of the cost of multiplication.

Saved in:

Bibliographic Details
Published in:	Applicable algebra in engineering, communication and computing Vol. 27; no. 2; pp. 105 - 122
Main Author:	van der Hoeven, Joris
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2016
Subjects:	Artificial Intelligence Computer Hardware Computer Science Original Paper Symbolic and Algebraic Manipulation Theory of Computation 68Q15 68W30 Multiplication 12E15 Local solution 34M03 Division lclm Linear differential operators Algorithm gcrd Complexity
ISSN:	0938-1279, 1432-0622
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!