Average complexity of divide-and-conquer algorithms
The goal of this paper is to describe a rather general approach for constructing upper and lower bounds for the average computational complexity of divide-and-conquer algorithms.
scientific article; zbMATH DE number 4082969
scientific article