Division-free computation of subresultants using Bezout matrices (Q5850765): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / 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: Fast parallel matrix and GCD computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of the Bézout and Dixon resultant matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Various new expressions for subresultants and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizations of the subresultant algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2725945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New structure theorem for subresultants / 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: Subresultants revisited. / rank
 
Normal rank

Latest revision as of 08:43, 2 July 2024

scientific article; zbMATH DE number 5658709
Language Label Description Also known as
English
Division-free computation of subresultants using Bezout matrices
scientific article; zbMATH DE number 5658709

    Statements

    Identifiers