The automatic complexity analysis of divide-and-conquer algorithmsReport as inadecuate




The automatic complexity analysis of divide-and-conquer algorithms - Download this document for free, or read online. Document in PDF available to download.

1 INRIA Rocquencourt

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.





Author: Paul Zimmermann - Wolf Zimmermann

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents