Improved bounds for the CF algorithm (Q385006): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ISOLATE / rank
 
Normal rank
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.tcs.2012.10.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993041502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Vincent's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementations of a new theorem for computing bounds for positive roots of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of Vincent's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost tight recursion tree bounds for the Descartes method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random polynomials and expected complexity of bisection methods for real solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real Algebraic Numbers: Complexity Analysis and Experimentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for absolute positiveness of multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A worst-case bound for topology computation of algebraic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for the Descartes method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal search for rationals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for computing Hong's bound on absolute positiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic algorithm for isolating real roots of a real polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Polynomial Equation: Some History and Recent Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient isolation of polynomial's real roots. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the Descartes method when using approximate arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Newton meets Descartes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of real root isolation using continued fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Univariate Polynomial Real Root Isolation: Continued Fractions Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of real root isolation using continued fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953977 / rank
 
Normal rank

Latest revision as of 02:26, 7 July 2024

scientific article
Language Label Description Also known as
English
Improved bounds for the CF algorithm
scientific article

    Statements

    Improved bounds for the CF algorithm (English)
    0 references
    29 November 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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