The automatic complexity analysis of divide-and-conquer algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1989

The automatic complexity analysis of divide-and-conquer algorithms

Paul Zimmermann
Wolf Zimmermann
  • Function : Author

Abstract

Current tools performing automatic complexity analysis are capable to deal with function definitions based on structural induction. Divide-and-conquer algorithms with "intelligent" divide function (like quicksort) are not based on structural induction, but on noetherian induction. This paper presents a method of automatic complexity analysis to deal with such kinds of functions.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1149.pdf (272.05 Ko) Télécharger le fichier

Dates and versions

inria-00075410 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00075410 , version 1

Cite

Paul Zimmermann, Wolf Zimmermann. The automatic complexity analysis of divide-and-conquer algorithms. [Research Report] RR-1149, INRIA. 1989. ⟨inria-00075410⟩
193 View
558 Download

Share

Gmail Facebook X LinkedIn More