Articles under category:
Note
Note
|
Volume 7, Article 13 (pages 185-188)
[NOTE]
Computing Polynomials with Few Multiplications by Shachar Lovett |
|
Volume 7, Article 12 (pages 177-184)
[NOTE]
On Circuit Lower Bounds from Derandomization by Scott Aaronson and Dieter van Melkebeek |
|
Volume 7, Article 10 (pages 147-153)
[NOTE]
The Influence Lower Bound Via Query Elimination by Rahul Jain and Shengyu Zhang |
|
Volume 7, Article 4 (pages 45-48)
[NOTE]
Tight Bounds on the Average Sensitivity of k-CNF by Kazuyuki Amano |
|
Volume 7, Article 2 (pages 19-25)
[NOTE]
Inverting a Permutation is as Hard as Unordered Search by Ashwin Nayak |
|
Volume 6, Article 4 (pages 81-84)
[NOTE]
Decision Trees and Influence: an Inductive Proof of the OSSS Inequality by Homin K. Lee |
|
Volume 5, Article 7 (pages 135-140)
[NOTE]
A Simple Proof of Toda's Theorem by Lance Fortnow |
|
Volume 5, Article 5 (pages 119-123)
[NOTE]
Discrete-Query Quantum Algorithm for NAND Trees by Andrew M. Childs, Richard Cleve, Stephen P. Jordan, and David Yonge-Mallo |