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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5580319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Algebraic K-Theory. (AM-72) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Pathologies in Algebraic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3290963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Computation of Linear Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for computing functions, using connectivity properties of their circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3936919 / rank
 
Normal rank

Latest revision as of 15:56, 13 June 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