✦ LIBER ✦

[Lecture Notes in Computer Science] LATIN 2006: Theoretical Informatics Volume 3887 || Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms

✍ Scribed by Correa, José R.; Hevia, Alejandro; Kiwi, Marcos

Book ID: 111900746
Publisher: Springer Berlin Heidelberg
Year: 2006
Tongue: German
Weight: 478 KB
Category: Article
ISBN: 3540327568
DOI: 10.1007/11682462_71

No coin nor oath required. For personal study only.

✦ Synopsis

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 Presented Are Devoted To A Broad Range Of Topics In Theoretical Computer Science With A Focus On Algorithmics And Computations Related To Discrete Mathematics As Well As On Cryptography, Data Compression And Web Applications.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computational Intelligence and Security Volume 4456 || About the Time Complexity of Evolutionary Algorithms Based on Finite Search Space

✍ Wang, Yuping; Cheung, Yiu-ming; Liu, Hailin 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 354 KB

The Refereed Post-proceedings Of The International Conference On Computational Intelligence And Security Are Presented In This Volume. The 116 Papers Were Submitted To Two Rounds Of Careful Review. Papers Cover Bio-inspired Computing, Evolutionary Computation, Learning Systems And Multi-agents, Cryp