The Complexity of Computing the k-ary Composition of a Binary Associative Operator
DOI:
https://doi.org/10.7146/brics.v3i42.20024Resumé
We show that the problem of computing all contiguous k-ary compositions of a sequence of n values under an associative and commutative operator requires 3(k−1)/ (k+1)n − O(k) operations.
For the operator max we show in contrast that in the decision
tree model the complexity is (1+ Theta(1/sqrt(k)) n − O(k).
Finally we show that the complexity of the corresponding on-line problem for the operator max is (2 − 1/(k−1)) n − O(k).
Downloads
Publiceret
1996-06-12
Citation/Eksport
Brodal, G. S., & Skyum, S. (1996). The Complexity of Computing the k-ary Composition of a Binary Associative Operator. BRICS Report Series, 3(42). https://doi.org/10.7146/brics.v3i42.20024
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
