𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving

✍ Scribed by Osman Hasan; Sofiène Tahar


Book ID
106578136
Publisher
Springer
Year
2010
Tongue
English
Weight
371 KB
Volume
25
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.