✦ LIBER ✦

Lifting lower bounds for tree-like proofs

✍ Scribed by Maciel, Alexis; Nguyen, Phuong; Pitassi, Toniann

Book ID: 120788009
Publisher: Springer
Year: 2013
Tongue: English
Weight: 584 KB
Volume: 23
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-013-0064-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exponential lower bounds for the tree-li

Exponential lower bounds for the tree-like Hajós calculus

✍ Kazuo Iwama; Toniann Pitassi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 572 KB

Exponential Lower Bounds and Integrality

Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász–Schrijver Procedures

✍ Pitassi, Toniann; Segerlind, Nathan 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 424 KB

Alternation-Trading Proofs, Linear Progr

Alternation-Trading Proofs, Linear Programming, and Lower Bounds

✍ Williams, Ryan 📂 Article 📅 2013 🏛 Association for Computing Machinery 🌐 English ⚖ 326 KB

Lower bounds for algebraic decision tree

Lower bounds for algebraic decision trees

✍ J Michael Steele; Andrew C Yao 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 445 KB

Lower bounds on static Lovász-Schrijver

Lower bounds on static Lovász-Schrijver calculus proofs for Tseitin tautologies

✍ D. M. Itsykson; A. A. Kojevnikov 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 212 KB

Entropy lower bounds for quantum decisio

Entropy lower bounds for quantum decision tree complexity

✍ Yaoyun Shi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 70 KB

We prove a general lower bound of quantum decision tree complexity in terms of some entropy notion. We regard decision tree computation as a communication process in which the oracle and the computer exchange several rounds of messages, each round consisting of O(log n) bits. Let E(f ) be the Shanno