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