Additive complexity in directed computations (Q1164996)

From MaRDI portal
Revision as of 15:56, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Additive complexity in directed computations
scientific article

    Statements

    Additive complexity in directed computations (English)
    0 references
    1982
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    additive straight-line program
    0 references
    triangular computation
    0 references
    directed computation
    0 references
    generalized Bruhat decomposition
    0 references
    sets of linear forms
    0 references
    triangular complexity measure
    0 references
    directed complexity measure
    0 references
    substitution
    0 references
    Coxeter groups
    0 references
    Chevalley groups
    0 references
    weak form of Valiant's conjecture
    0 references
    non- linear lower bounds
    0 references
    0 references
    0 references