Abstract is missing.
- No Strong Parallel Repetition with Entangled and Non-signaling ProversJulia Kempe, Oded Regev. 7-15 [doi]
- Derandomized Parallel Repetition of Structured PCPsIrit Dinur, Or Meir. 16-27 [doi]
- Derandomized Parallel Repetition Theorems for Free GamesRonen Shaltiel. 28-37 [doi]
- Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower BoundsDan Gutfreund, Akinori Kawachi. 38-49 [doi]
- Simple Affine Extractors Using Dimension ExpansionMatt DeVos, Ariel Gabizon. 50-57 [doi]
- Derandomizing from Random StringsHarry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff. 58-63 [doi]
- On the Power of Randomized Reductions and the Checkability of SATMohammad Mahmoody, David Xiao. 64-75 [doi]
- A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NPIftach Haitner, Mohammad Mahmoody, David Xiao. 76-87 [doi]
- The Program-Enumeration Bottleneck in Average-Case Complexity TheoryLuca Trevisan. 88-95 [doi]
- Spectral Algorithms for Unique GamesAlexandra Kolla. 122-130 [doi]
- A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few SourcesDerrick Stolee, Chris Bourke, N. V. Vinodchandran. 131-138 [doi]
- On the Matching Problem for Special Graph ClassesThanh Minh Hoang. 139-150 [doi]
- On the Relative Strength of Pebbling and ResolutionJakob Nordström. 151-162 [doi]
- Trade-Off Lower Bounds for Stack MachinesMatei David, Periklis A. Papakonstantinou. 163-171 [doi]
- Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown AutomataEric Allender, Klaus-Jörn Lange. 172-180 [doi]
- Completely Inapproximable Monotone and Antimonotone Parameterized ProblemsDániel Marx. 181-187 [doi]
- The Learning with Errors Problem (Invited Survey)Oded Regev. 191-204 [doi]
- The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold FunctionsDaniel M. Kane. 205-210 [doi]
- A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold FunctionsIlias Diakonikolas, Rocco A. Servedio, Li-Yang Tan, Andrew Wan. 211-222 [doi]
- Fooling Functions of Halfspaces under Product DistributionsParikshit Gopalan, Ryan O Donnell, Yi Wu, David Zuckerman. 223-234 [doi]
- Lower Bounds for Testing Function IsomorphismEric Blais, Ryan O Donnell. 235-246 [doi]
- Communication Complexity with Synchronized ClocksRussell Impagliazzo, Ryan Williams. 259-269 [doi]
- Exact Threshold CircuitsKristoffer Arnsfelt Hansen, Vladimir V. Podolskii. 270-279 [doi]
- Relationless Completeness and SeparationsPavel Hrubes, Avi Wigderson, Amir Yehudayoff. 280-290 [doi]
- On Matrix Rigidity and Locally Self-Correctable CodesZeev Dvir. 291-298 [doi]