The fastest exact algorithms for the isolation of the real roots of a polynomial equation (Q1137352): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the implementation of cauchy's rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the forgotten theorem of Mr. Vincent / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of algorithms for the translation of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Arithmetic Algorithms for Polynomial Real Zero Determination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for the discriminant of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536376 / rank
 
Normal rank

Latest revision as of 03:29, 13 June 2024

scientific article
Language Label Description Also known as
English
The fastest exact algorithms for the isolation of the real roots of a polynomial equation
scientific article

    Statements

    The fastest exact algorithms for the isolation of the real roots of a polynomial equation (English)
    0 references
    0 references
    0 references
    1980
    0 references
    fastest exact algorithms
    0 references
    algorithms
    0 references
    polynomial equation
    0 references
    integer coefficients
    0 references
    integer arithmetic
    0 references
    Vincent-Uspensky-Akritas theorem
    0 references
    real roots
    0 references
    empirical results
    0 references

    Identifiers