✦ LIBER ✦

The Black-Box Query Complexity of Polynomial Summation

✍ Scribed by Ali Juma; Valentine Kabanets; Charles Rackoff; Amir Shpilka

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Quantum Black-Box Complexity of Majo

✍ Hayes; Kutin; van Melkebeek 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 154 KB

On the Black-Box Complexity of Sperner’s

✍ Katalin Friedl; Gábor Ivanyos; Miklos Santha; Yves F. Verhoeven 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 455 KB

The query complexity of estimating weigh

✍ Amit Chakrabarti; Venkatesan Guruswami; Andrew Wirth; Anthony Wirth 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 160 KB

The Complexity of Polynomial-Time Approx

✍ Liming Cai; Michael Fellows; David Juedes; Frances Rosamond 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 253 KB

Quantum and Classical Query Complexities

✍ Miklos Santha; Mario Szegedy 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 446 KB

On the Quantum Query Complexity of Local

✍ Xiaoming Sun; Andrew Chi-Chih Yao 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 539 KB