A near-optimal algorithm for computing real roots of sparse polynomials (Q3452416): Difference between revisions

From MaRDI portal
Changed an 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 / OpenAlex ID
 
Property / OpenAlex ID: W2059357470 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.6011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Jordan Curve Theorem, Formally and Informally / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability and decision problems in arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cylindrical algebraic decomposition using validated numerics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414313 / rank
 
Normal rank

Latest revision as of 01:09, 11 July 2024

scientific article
Language Label Description Also known as
English
A near-optimal algorithm for computing real roots of sparse polynomials
scientific article

    Statements

    A near-optimal algorithm for computing real roots of sparse polynomials (English)
    0 references
    0 references
    11 November 2015
    0 references
    arithmetic complexity
    0 references
    bit complexity
    0 references
    numerical algorithms
    0 references
    root isolation
    0 references
    root refinement
    0 references
    sparse polynomials
    0 references

    Identifiers