𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE Twenty-Second Annual IEEE Conference on Computational Complexity - San Diego, CA, USA (2007.06.13-2007.03.16)] Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) - An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity

✍ Scribed by Uchizawa, Kei; Takimoto, Eiji

Book ID: 121703409
Publisher: IEEE
Year: 2007
Weight: 239 KB
Category: Article
ISBN-13: 9780769527802
DOI: 10.1109/ccc.2007.4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE Twenty-Second Annual IEEE Conferen

[IEEE Twenty-Second Annual IEEE Conference on Computational Complexity - San Diego, CA, USA (2007.06.13-2007.03.16)] Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) - The Communication Complexity of Correlation

✍ Harsha, Prahladh; Jain, Rahul; McAllester, David; Radhakrishnan, Jaikumar 📂 Article 📅 2007 🏛 IEEE ⚖ 259 KB

[IEEE Twenty-Second Annual IEEE Conferen

[IEEE Twenty-Second Annual IEEE Conference on Computational Complexity - San Diego, CA, USA (2007.06.13-2007.03.16)] Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) - Efficient Arguments without Short PCPs

✍ Ishai, Yuval; Kushilevitz, Eyal; Ostrovsky, Rafail 📂 Article 📅 2007 🏛 IEEE ⚖ 269 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