✦ LIBER ✦

Gems of Theoretical Computer Science || Kolmogorov Complexity, the Universal Distribution, and Worst-Case vs. Average-Case

✍ Scribed by Schöning, Uwe; Pruim, Randall

Book ID: 120242196
Publisher: Springer Berlin Heidelberg
Year: 1998
Weight: 634 KB
Category: Article
ISBN: 364260322X
DOI: 10.1007/978-3-642-60322-8_9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Average case complexity under the univer

Average case complexity under the universal distribution equals worst-case complexity

✍ Ming Li; Paul M.B. Vitányi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 461 KB

[Lecture Notes in Computer Science] Appr

[Lecture Notes in Computer Science] Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Volume 4110 || Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy

✍ Díaz, Josep; Jansen, Klaus; Rolim, José D. P.; Zwick, Uri 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 452 KB

This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers