𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[ACM Press the thirty-sixth annual ACM symposium - Chicago, IL, USA (2004.06.13-2004.06.16)] Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04 - Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

✍ Scribed by Spielman, Daniel A.; Teng, Shang-Hua


Book ID
121283105
Publisher
ACM Press
Year
2004
Tongue
English
Weight
248 KB
Category
Article
ISBN-13
9781581138528

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES