Optimal algorithms for sensitivity analysis in associative multiplication problems (Q1149785): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067532490 / rank
 
Normal rank

Revision as of 21:57, 19 March 2024

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