Abstract is missing.
- Goldreich's PRG: Evidence for Near-Optimal Polynomial StretchRyan O'Donnell, David Witmer. 1-12 [doi]
- On the Power of Symmetric LP and SDP RelaxationsJames R. Lee, Prasad Raghavendra, David Steurer, Ning Tan. 13-21 [doi]
- Quantum Algorithms for Learning Symmetric Juntas via Adversary BoundAleksandrs Belovs. 22-31 [doi]
- On Physical Problems that are Slightly More Difficult than QMAAndris Ambainis. 32-43 [doi]
- AM with Multiple MerlinsScott Aaronson, Russell Impagliazzo, Dana Moshkovitz. 44-55 [doi]
- Counting List Matrix Partitions of GraphsAndreas Göbel 0001, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami. 56-65 [doi]
- Counting the Number of Perfect Matchings in K5-Free GraphsSimon Straub, Thomas Thierauf, Fabian Wagner. 66-77 [doi]
- Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPsRishi Saket. 78-89 [doi]
- Locally Dense CodesDaniele Micciancio. 90-97 [doi]
- On the Closest Vector Problem with a Distance GuaranteeDaniel Dadush, Oded Regev, Noah Stephens-Davidowitz. 98-109 [doi]
- Algorithms for Group Isomorphism via Group Extensions and CohomologyJoshua A. Grochow, Youming Qiao. 110-119 [doi]
- Low Influence Functions over Slices of the Boolean Hypercube Depend on Few CoordinatesKarl Wimmer. 120-131 [doi]
- On the Sum of L1 InfluencesArturs Backurs, Mohammad Bavarian. 132-143 [doi]
- A Composition Theorem for Parity Kill NumberRyan O'Donnell, John Wright, Yu Zhao, Xiaorui Sun, Li-Yang Tan. 144-154 [doi]
- Recent Progress on Lower Bounds for Arithmetic CircuitsShubhangi Saraf. 155-160 [doi]
- Hitting Sets for Low-Degree Polynomials with Optimal DensityVenkatesan Guruswami, Chaoping Xing. 161-168 [doi]
- Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial FactorizationSwastik Kopparty, Shubhangi Saraf, Amir Shpilka. 169-180 [doi]
- Noncommutative Determinant is Hard: A Simple Proof Using an Extension of Barrington's TheoremCraig Gentry. 181-187 [doi]
- Direct Product TestingIrit Dinur, David Steurer. 188-196 [doi]
- A Parallel Repetition Theorem for Entangled Projection GamesIrit Dinur, David Steurer, Thomas Vidick. 197-208 [doi]
- A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product DistributionsRahul Jain, Attila Pereszlényi, Penghui Yao. 209-216 [doi]
- A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed LengthDaniel M. Kane. 217-228 [doi]
- Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold FunctionsAnindya De, Ilias Diakonikolas, Rocco A. Servedio. 229-240 [doi]
- Linear List-Approximation for Short Programs (or the Power of a Few Random Bits)Bruno Bauwens, Marius Zimand. 241-247 [doi]
- Algorithms for Circuits and Circuits for AlgorithmsRyan Williams. 248-261 [doi]
- Mining Circuit Lower Bound Proofs for Meta-algorithmsRuiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman. 262-273 [doi]
- Unifying Known Lower Bounds via Geometric Complexity TheoryJoshua A. Grochow. 274-285 [doi]
- Narrow Proofs May Be Maximally LongAlbert Atserias, Massimo Lauria, Jakob Nordström. 286-297 [doi]
- Overlays and Limited Memory CommunicationPeriklis A. Papakonstantinou, Dominik Scheder, Hao Song. 298-308 [doi]
- Lower Bounds for Testing Properties of Functions over Hypergrid DomainsEric Blais, Sofya Raskhodnikova, Grigory Yaroslavtsev. 309-320 [doi]
- Fourier Concentration from ShrinkageRussell Impagliazzo, Valentine Kabanets. 321-332 [doi]