登入
選單
返回
Google圖書搜尋
Multidimensional Divide-and-conquer Maximin Recurrences
Laurent Alonso
Edward M. Reingold
René Schott
出版
University of Illinois at Urbana-Champaign, Department of Computer Science
, 1992
URL
http://books.google.com.hk/books?id=2lXtP-FfYaQC&hl=&source=gbs_api
註釋
Abstract: "Bounds are obtained for the solution to the divide- and-conquer recurrence M(n) = [formula], for nondecreasing functions f. Similar bounds are found for the recurrence with 'min' replaced by 'sum-of- all-but-the-max.' Such recurrences appear in the analysis of various algorithms."