A deterministic algorithm for inverting a polynomial matrix (Q2254681): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jco.2014.09.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107482418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal forms for general polynomial matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essentially optimal computation of the inverse of generic polynomial matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast projection methods for minimal design problems in linear system theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for the characteristic polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-order lifting and integrality certification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for order basis computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimal nullspace bases / rank
 
Normal rank

Latest revision as of 15:41, 9 July 2024

scientific article
Language Label Description Also known as
English
A deterministic algorithm for inverting a polynomial matrix
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references