✦ LIBER ✦

Small PCPs with low query complexity

✍ Scribed by P. Harsha; M. Sudan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Short PCPs with Polylog Query Complexity

✍ Ben-Sasson, Eli; Sudan, Madhu 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 626 KB

Reconstructing weighted graphs with mini

✍ Nader H. Bshouty; Hanna Mazzawi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Effects of query complexity and learning

✍ Siau, K.L.; Hock Chuan Chan; Kwok Kee Wei 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 163 KB

Toward a deterministic polynomial time a

✍ Nader H. Bshouty; Hanna Mazzawi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 272 KB

Sets with small generalized Kolmogorov c

✍ José L. Balcázar; Ronald V. Book 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 571 KB

Fast graph query processing with a low-c

✍ James Cheng; Yiping Ke; Ada Wai-Chee Fu; Jeffrey Xu Yu 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 642 KB