✦ LIBER ✦

Average complexity of Moore’s and Hopcroft’s algorithms

✍ Scribed by Julien David

Book ID: 113927573
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 545 KB
Volume: 417
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.10.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On extremal cases of Hopcroft’s algorith

On extremal cases of Hopcroft’s algorithm

✍ G. Castiglione; A. Restivo; M. Sciortino 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 451 KB

Average Case Analysis of Moore’s State M

Average Case Analysis of Moore’s State Minimization Algorithm

✍ Frédérique Bassino; Julien David; Cyril Nicaud 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 831 KB

Average complexity of divide-and-conquer

Average complexity of divide-and-conquer algorithms

✍ Boris S. Veroy 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 420 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 algorithms usin

Average-case analysis of algorithms using Kolmogorov complexity

✍ Tao Jiang; Ming Li; Paul M. B. Vitányi 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 445 KB

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