Optimal algorithms for sensitivity analysis in associative multiplication problems (Q1149785): Difference between revisions
From MaRDI portal
Latest revision as of 10:37, 13 June 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
1981
0 references
deterministic variation schemes
0 references
lower bounds
0 references
binary search trees
0 references
Huffman trees
0 references