Additive complexity in directed computations (Q1164996): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(82)90014-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2118664263 / rank
 
Normal rank

Revision as of 23:26, 19 March 2024

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