Complexity of factoring and calculating the GCD of linear ordinary differential operators (Q805235): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dima Yu. Grigoriev / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Didier Robert / rank
Normal rank
 
Property / author
 
Property / author: Dima Yu. Grigoriev / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Didier Robert / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4747509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3473702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability and fast quantifier elimination in algebraically closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on transcendental numbers. Edited and completed by B. Diviš and W. J. LeVeque / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4771357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liouvillian Solutions of n-th Order Homogeneous Linear Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5555887 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0747-7171(08)80034-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2103078973 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:11, 30 July 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
    0 references
    0 references

    Identifiers