Complexity of factoring and calculating the GCD of linear ordinary differential operators
- 31 July 1990
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 10 (1) , 7-37
- https://doi.org/10.1016/s0747-7171(08)80034-x
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial FactorizationSIAM Journal on Computing, 1985
- Definability and fast quantifier elimination in algebraically closed fieldsTheoretical Computer Science, 1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Liouvillian Solutions of n-th Order Homogeneous Linear Differential EquationsAmerican Journal of Mathematics, 1981