On the Complexity of Reliable Root Approximation (Q3644097): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1507596250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5657612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301664 / 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: Q4391224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / 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: Q4953977 / rank
 
Normal rank

Latest revision as of 03:13, 2 July 2024

scientific article
Language Label Description Also known as
English
On the Complexity of Reliable Root Approximation
scientific article

    Statements

    On the Complexity of Reliable Root Approximation (English)
    0 references
    0 references
    10 November 2009
    0 references

    Identifiers