✦ LIBER ✦

Entangled Games Are Hard to Approximate

✍ Scribed by Kempe, Julia; Kobayashi, Hirotada; Matsumoto, Keiji; Toner, Ben; Vidick, Thomas

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unique Games with Entangled Provers Are

✍ Kempe, Julia; Regev, Oded; Toner, Ben 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 319 KB

Random low-degree polynomials are hard t

✍ Ido Ben-Eliezer; Rani Hod; Shachar Lovett 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 302 KB

Hard-to-Solve Bimatrix Games

✍ Rahul Savani; Bernhard von Stengel 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 390 KB

Matrix p -Norms Are NP-Hard to Approxima

✍ Hendrickx, Julien M.; Olshevsky, Alex 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 194 KB

Hard Sets Are Hard to Find

✍ Harry Buhrman; Dieter van Melkebeek 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Stackelberg network pricing is hard to a

✍ Gwenaë Joret 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB