1 | -- | 18 | Zeev Dvir, Amir Shpilka. Noisy Interpolating Sets for Low-Degree Polynomials |
19 | -- | 25 | Ashwin Nayak. Inverting a Permutation is as Hard as Unordered Search |
27 | -- | 43 | Per Austrin, Subhash Khot, Muli Safra. Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs |
45 | -- | 48 | Kazuyuki Amano. Tight Bounds on the Average Sensitivity of k-CNF |
49 | -- | 74 | Robert Krauthgamer, Tim Roughgarden. Metric Clustering via Consistent Labeling |
75 | -- | 99 | Arnab Bhattacharyya, Victor Chen, Madhu Sudan, Ning Xie. Testing Linear-Invariant Non-Linear Properties |
101 | -- | 117 | Salman Beigi, Peter W. Shor, John Watrous. Quantum Interactive Proofs with Short Messages |
119 | -- | 129 | Pavel Hrubes, Amir Yehudayoff. Arithmetic Complexity in Ring Extensions |
131 | -- | 145 | Shachar Lovett, Roy Meshulam, Alex Samorodnitsky. Inverse Conjecture for the Gowers Norm is False |
147 | -- | 153 | Rahul Jain, Shengyu Zhang. The Influence Lower Bound Via Query Elimination |
155 | -- | 176 | Elya Dolev, Dana Ron. Distribution-Free Testing for Monomials with a Sublinear Number of Queries |
177 | -- | 184 | Scott Aaronson, Dieter van Melkebeek. On Circuit Lower Bounds from Derandomization |
185 | -- | 188 | Shachar Lovett. Computing Polynomials with Few Multiplications |