𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Gems of Theoretical Computer Science || Lower Bounds via Kolmogorov Complexity

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

Book ID
120245041
Publisher
Springer Berlin Heidelberg
Year
1998
Weight
604 KB
Category
Article
ISBN
364260322X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] LATI
[Lecture Notes in Computer Science] LATIN 2006: Theoretical Informatics Volume 3887 || Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
✍ Correa, José R.; Hevia, Alejandro; Kiwi, Marcos 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 478 KB

This Book Constitutes The Refereed Proceedings Of The 7th International Symposium, Latin American Theoretical Informatics, Latin 2006, Held In March 2006. The 66 Revised Full Papers Presented Together With Seven Invited Papers Were Carefully Reviewed And Selected From 224 Submissions. The Papers Pre