𝔖 Bobbio Scriptorium

✦ LIBER ✦

[ACM Press the 43rd annual ACM symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 - The computational complexity of linear optics

✍ Scribed by Aaronson, Scott; Arkhipov, Alex

Book ID: 118027644
Publisher: ACM Press
Year: 2011
Weight: 583 KB
Volume: 0
Category: Article
ISBN: 1450306918
DOI: 10.1145/1993636.1993682

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[ACM Press the 43rd annual ACM symposium

[ACM Press the 43rd annual ACM symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 - Approximate polytope membership queries

✍ Arya, Sunil; da Fonseca, Guilherme D.; Mount, David M. 📂 Article 📅 2011 🏛 ACM Press ⚖ 453 KB

[ACM Press the 43rd annual ACM symposium

[ACM Press the 43rd annual ACM symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 - Geometric complexity theory and tensor rank

✍ Bürgisser, Peter; Ikenmeyer, Christian 📂 Article 📅 2011 🏛 ACM Press ⚖ 515 KB

[ACM Press the 43rd annual ACM symposium

[ACM Press the 43rd annual ACM symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 - From convex optimization to randomized mechanisms

✍ Dughmi, Shaddin; Roughgarden, Tim; Yan, Qiqi 📂 Article 📅 2011 🏛 ACM Press ⚖ 496 KB

[ACM Press the 43rd annual ACM symposium

[ACM Press the 43rd annual ACM symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 - Social networks spread rumors in sublogarithmic time

✍ Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias 📂 Article 📅 2011 🏛 ACM Press ⚖ 665 KB

[ACM Press the 43rd annual ACM symposium

[ACM Press the 43rd annual ACM symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 - Breaking o(n 1/2 )-approximation algorithms for the edge-disjoint paths problem with congestion two

✍ Kawarabayashi, Ken-ichi; Kobayashi, Yusuke 📂 Article 📅 2011 🏛 ACM Press ⚖ 422 KB

[ACM Press the 30th annual ACM SIGACT-SI

[ACM Press the 30th annual ACM SIGACT-SIGOPS symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11 - Xheal

✍ Pandurangan, Gopal; Trehan, Amitabh 📂 Article 📅 2011 🏛 ACM Press 🌐 English ⚖ 536 KB