On the complexity of inverting integer and polynomial matrices (Q901933): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/s00037-015-0106-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1862524307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Integer Multiplication Using Modular Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of linear equations using p-adic expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hermite Normal Form Computation Using Modulo Determinant Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Integer Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Computer Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing hermite forms of polynomial matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Fast Triangularization of Matrices over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix / 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: Q4234262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary Divisors and Modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified dense linear system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Preconditioning for Matrix Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of continued fraction expansions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shifted number system for fast linear algebra on integer matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic algorithm for inverting a polynomial matrix / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:44, 11 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of inverting integer and polynomial matrices
scientific article

    Statements

    On the complexity of inverting integer and polynomial matrices (English)
    0 references
    0 references
    6 January 2016
    0 references
    integer matrix
    0 references
    polynomial matrix
    0 references
    matrix inverse
    0 references
    Smith normal form
    0 references
    bit complexity
    0 references
    randomized algorithm
    0 references

    Identifiers

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