Complexity of factorization and GCD computation for linear ordinary differential operators (Q684956)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of factorization and GCD computation for linear ordinary differential operators |
scientific article; zbMATH DE number 416596
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of factorization and GCD computation for linear ordinary differential operators |
scientific article; zbMATH DE number 416596 |
Statements
Complexity of factorization and GCD computation for linear ordinary differential operators (English)
0 references
15 September 1993
0 references
See the review in Zbl 0704.65050.
0 references
complexity
0 references
factorization
0 references
linear ordinary differential operators
0 references
rational coefficients
0 references
irreducible operators
0 references
algorithm
0 references
fundamental solutions
0 references
greatest common divisor
0 references
