Average complexity of divide-and-conquer algorithms

Document Type

Article

Publication Date

12-8-1988

Abstract

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. © 1988.

Identifier

0024282094 (Scopus)

Publication Title

Information Processing Letters

External Full Text Location

https://doi.org/10.1016/0020-0190(88)90232-3

ISSN

00200190

First Page

319

Last Page

326

Issue

6

Volume

29

This document is currently not available here.

Share

COinS