𝔖 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 - Rational secret sharing and multiparty computation

✍ Scribed by Halpern, Joseph; Teague, Vanessa

Book ID: 118263312
Publisher: ACM Press
Year: 2004
Tongue: English
Weight: 218 KB
Volume: 0
Category: Article
ISBN-13: 9781581138528
DOI: 10.1145/1007352.1007447

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[ACM Press the thirty-sixth annual ACM s

[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 - Computing Nash equilibria for scheduling on restricted parallel links

✍ Gairing, Martin; Lücking, Thomas; Mavronicolas, Marios; Monien, Burkhard 📂 Article 📅 2004 🏛 ACM Press 🌐 English ⚖ 256 KB

[ACM Press the thirty-sixth annual ACM s

[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 - The quantum adiabatic optimization algorithm and local minima

✍ Reichardt, Ben W. 📂 Article 📅 2004 🏛 ACM Press 🌐 English ⚖ 320 KB

[ACM Press the thirty-sixth annual ACM s

[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 - The quantum adiabatic optimization algorithm and local minima

✍ Reichardt, Ben W. 📂 Article 📅 2004 🏛 ACM Press 🌐 English ⚖ 320 KB

[ACM Press the thirty-sixth annual ACM s

[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 - Approximating the cut-norm via Grothendieck's inequality

✍ Alon, Noga; Naor, Assaf 📂 Article 📅 2004 🏛 ACM Press 🌐 English ⚖ 212 KB

[ACM Press the thirty-sixth annual ACM s

[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

✍ Spielman, Daniel A.; Teng, Shang-Hua 📂 Article 📅 2004 🏛 ACM Press 🌐 English ⚖ 248 KB

[ACM Press the thirty-sixth annual ACM s

[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

✍ Spielman, Daniel A.; Teng, Shang-Hua 📂 Article 📅 2004 🏛 ACM Press 🌐 English ⚖ 248 KB