𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE 2009 24th Annual IEEE Conference on Computational Complexity (CCC) - Paris, France (2009.07.15-2009.07.18)] 2009 24th Annual IEEE Conference on Computational Complexity - Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies

✍ Scribed by Ito, Tsuyoshi; Kobayashi, Hirotada; Matsumoto, Keiji

Book ID: 126618650
Publisher: IEEE
Year: 2009
Weight: 346 KB
Category: Article
ISBN: 0769537170
DOI: 10.1109/CCC.2009.22

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE 2009 24th Annual IEEE Conference o

[IEEE 2009 24th Annual IEEE Conference on Computational Complexity (CCC) - Paris, France (2009.07.15-2009.07.18)] 2009 24th Annual IEEE Conference on Computational Complexity - An Approximation Algorithm for Approximation Rank

✍ Lee, Troy; Shraibman, Adi 📂 Article 📅 2009 🏛 IEEE ⚖ 322 KB

[IEEE 2009 24th Annual IEEE Conference o

[IEEE 2009 24th Annual IEEE Conference on Computational Complexity (CCC) - Paris, France (2009.07.15-2009.07.18)] 2009 24th Annual IEEE Conference on Computational Complexity - Planar Graph Isomorphism is in Log-Space

✍ Datta, Samir; Limaye, Nutan; Nimbhorkar, Prajakta; Thierauf, Thomas; Wagner, Fab 📂 Article 📅 2009 🏛 IEEE ⚖ 348 KB

[IEEE 2009 24th Annual IEEE Conference o

[IEEE 2009 24th Annual IEEE Conference on Computational Complexity (CCC) - Paris, France (2009.07.15-2009.07.18)] 2009 24th Annual IEEE Conference on Computational Complexity - A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent

✍ Koiran, Pascal; Perifel, Sylvain 📂 Article 📅 2009 🏛 IEEE ⚖ 258 KB