𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach

✍ Scribed by Aharonov, Dorit; Arad, Itai; Landau, Zeph; Vazirani, Umesh

Book ID: 121213958
Publisher: IEEE
Year: 2011
Weight: 486 KB
Category: Article
ISBN: 145771843X
DOI: 10.1109/FOCS.2011.91

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE 2011 IEEE 52nd Annual Symposium on

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Medium Access Using Queues

✍ Shah, Devavrat; Shin, Jinwoo; Tetali, Prasad 📂 Article 📅 2011 🏛 IEEE ⚖ 618 KB

[IEEE 2011 IEEE 52nd Annual Symposium on

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - (1 + eps)-Approximate Sparse Recovery

✍ Price, Eric; Woodruff, David P. 📂 Article 📅 2011 🏛 IEEE ⚖ 524 KB

[IEEE 2011 IEEE 52nd Annual Symposium on

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - How to Garble Arithmetic Circuits

✍ Applebaum, Benny; Ishai, Yuval; Kushilevitz, Eyal 📂 Article 📅 2011 🏛 IEEE ⚖ 673 KB

[IEEE 2011 IEEE 52nd Annual Symposium on

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Approximating Graphic TSP by Matchings

✍ Moemke, Tobias; Svensson, Ola 📂 Article 📅 2011 🏛 IEEE ⚖ 777 KB

[IEEE 2011 IEEE 52nd Annual Symposium on

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - The Graph Minor Algorithm with Parity Conditions

✍ Kawarabayashi, Ken-ichi; Reed, Bruce; Wollan, Paul 📂 Article 📅 2011 🏛 IEEE ⚖ 406 KB

[IEEE 2011 IEEE 52nd Annual Symposium on

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Efficient Fully Homomorphic Encryption from (Standard) LWE

✍ Brakerski, Zvika; Vaikuntanathan, Vinod 📂 Article 📅 2011 🏛 IEEE ⚖ 544 KB