Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients (Q1351936): 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.1016/0304-3975(95)00090-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W123728415 / 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: On computing the determinant in small parallel time using a small number of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Solution of Systems of Linear Diophantine Equations / 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: Q4120626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity questions in number theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spécialisation de la suite de Sturm et sous-résultants (I) / 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: Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of linear equations over polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method of Determining Explicitly the Coefficients of the Characteristic Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized subresultants for computing the Smith normal form of polynomial matrices / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:12, 27 May 2024

scientific article
Language Label Description Also known as
English
Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
scientific article

    Statements

    Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients (English)
    0 references
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    0 references