✦ LIBER ✦

Average-case analysis of algorithms using Kolmogorov complexity

✍ Scribed by Tao Jiang; Ming Li; Paul M. B. Vitányi

Publisher: Springer
Year: 2000
Tongue: English
Weight: 445 KB
Volume: 15
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02950402

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the average-case complexity of “bucke

On the average-case complexity of “bucketing” algorithms

✍ Selim G Akl; Henk Meijer 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Average-Case Analysis of Dynamic Graph A

Average-Case Analysis of Dynamic Graph Algorithms

✍ D. Alberts; M. R. Henzinger 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 245 KB

Drift analysis and average time complexi

Drift analysis and average time complexity of evolutionary algorithms

✍ Jun He; Xin Yao 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 212 KB

The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some new results on the average time complexity of EAs. Based on drift analysis, some useful drift conditions for deriving the time complexity of EAs are studied, including cond

Average Case Analysis of Bounded Space B

Average Case Analysis of Bounded Space Bin Packing Algorithms

✍ Nir Naaman; Raphael Rom 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 501 KB

Average-case analysis of the Modified Ha

Average-case analysis of the Modified Harmonic algorithm

✍ Prakash Ramanan; Kazuhiro Tsuga 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 751 KB

The average-case parallel complexity of

The average-case parallel complexity of sorting

✍ Ravi B. Boppana 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 219 KB