Volume 1 (2005)
|
Vol 1, Article 1 (pp 1-28)
Limitations of Quantum Advice and One-Way Communication by Scott Aaronson |
|
Vol 1, Article 2 (pp 29-36)
Quantum Lower Bound for the Collision Problem with Small Range by Samuel Kutin |
|
Vol 1, Article 3 (pp 37-46)
Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range by Andris Ambainis |
|
Vol 1, Article 4 (pp 47-79)
Quantum Search of Spatial Regions by Scott Aaronson and Andris Ambainis |
|
Vol 1, Article 5 (pp 81-103)
Quantum Fan-out is Powerful by Peter Høyer and Robert Špalek |
|
Vol 1, Article 6 (pp 105-117)
Combining Online Algorithms for Acceptance and Rejection by Yossi Azar, Avrim Blum, David P. Bunde, and Yishay Mansour |
|
Vol 1, Article 7 (pp 119-148)
Query Efficient PCPs with Perfect Completeness by Johan Håstad and Subhash Khot |
|
Vol 1, Article 8 (pp 149-176)
A Non-linear Time Lower Bound for Boolean Branching Programs by Miklós Ajtai |
|
Vol 1, Article 9 (pp 177-216)
Linear Equations, Arithmetic Progressions and Hypergraph Property Testing by Noga Alon and Asaf Shapira |
| List of Editors |