Complexity of factoring and calculating the GCD of linear ordinary differential operators (Q805235): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Dima Yu. Grigoriev / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Didier Robert / rank | |||
Normal rank | |||
Revision as of 05:15, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of factoring and calculating the GCD of linear ordinary differential operators |
scientific article |
Statements
Complexity of factoring and calculating the GCD of linear ordinary differential operators (English)
0 references
1990
0 references
For linear differential operator L with rational coefficients the author studies an algorithm to factor L.
0 references
factoring
0 references
linear differential operator with rational coefficients
0 references
