Optimal algorithms for sensitivity analysis in associative multiplication problems (Q1149785)

From MaRDI portal
Revision as of 00:22, 14 July 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
Optimal algorithms for sensitivity analysis in associative multiplication problems
scientific article

    Statements

    Optimal algorithms for sensitivity analysis in associative multiplication problems (English)
    0 references
    0 references
    1981
    0 references
    deterministic variation schemes
    0 references
    lower bounds
    0 references
    binary search trees
    0 references
    Huffman trees
    0 references

    Identifiers