Computational complexity of a piecewise linear homotopy algorithm (Q3321342)

From MaRDI portal
Revision as of 19:49, 3 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computational complexity of a piecewise linear homotopy algorithm
scientific article

    Statements

    Computational complexity of a piecewise linear homotopy algorithm (English)
    0 references
    0 references
    0 references
    1984
    0 references
    0 references
    0 references
    0 references
    0 references
    average behavior
    0 references
    worst case behavior
    0 references
    arithmetic complexity
    0 references
    simplicial homotopy algorithm
    0 references
    large sparse nonlinear systems
    0 references