✦ LIBER ✦

Average complexity of divide-and-conquer algorithms

✍ Scribed by Boris S. Veroy

Book ID: 113163343
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 420 KB
Volume: 29
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(88)90232-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Average complexity of divide-and-conquer

Average complexity of divide-and-conquer algorithms: Information processing letters vol. 29, no. 6 (8 December 1988) pp. 319–326

✍ Boris S. Veroy 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 44 KB

Divide-and-conquer algorithms on the hyp

Divide-and-conquer algorithms on the hypercube

✍ Ernst W Mayr; Ralph Werchner 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 946 KB

Divide-and-conquer approximation algorit

Divide-and-conquer approximation algorithms via spreading metrics

✍ Even, Guy; Naor, Joseph Seffi; Rao, Satish; Schieber, Baruch 📂 Article 📅 2000 🏛 Association for Computing Machinery 🌐 English ⚖ 313 KB

Divide-and-conquer approximation algorit

Divide-and-conquer approximation algorithms via spreading metrics

✍ Even, Guy; Naor, Joseph Seffi; Rao, Satish; Schieber, Baruch 📂 Article 📅 2000 🏛 Association for Computing Machinery 🌐 English ⚖ 313 KB

Practical improvement of the divide-and-

Practical improvement of the divide-and-conquer eigenvalue algorithms

✍ D. Bini; V. Pan 📂 Article 📅 1992 🏛 Springer Vienna 🌐 English ⚖ 793 KB

Fast algorithms through divide- and comb

Fast algorithms through divide- and combine-and-conquer strategies

✍ José M. Pérez-Jordá 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 83 KB

The fast Fourier transform (FFF) algorithm is explained in a simple and rLovel way. It is shown how the two canonic forms of the Fb"I" (decimation in time and decimation in ,frequency) can be respectively arranged as "combine-and-conquer" or "'divide-and-conquer" algorithms. @