摘要：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).
