On the computational complexity of piecewise-linear homotopy algorithms (Q4749612)

From MaRDI portal
Revision as of 19:21, 9 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3805285
Language Label Description Also known as
English
On the computational complexity of piecewise-linear homotopy algorithms
scientific article; zbMATH DE number 3805285

    Statements

    On the computational complexity of piecewise-linear homotopy algorithms (English)
    0 references
    0 references
    1982
    0 references
    computational complexity
    0 references
    piecewise linear homotopy algorithm
    0 references
    exponential growth
    0 references
    linear complementarity problem
    0 references
    solutions nonlinear equations
    0 references
    fixed point algorithm
    0 references

    Identifiers

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