Abstract is missing.
- Amplifying Circuit Lower Bounds against Polynomial Time with ApplicationsRichard J. Lipton, Ryan Williams. 1-9 [doi]
- Is Valiant-Vazirani's Isolation Probability Improvable?Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe. 10-20 [doi]
- Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum GamesGus Gutoski, Xiaodi Wu. 21-31 [doi]
- The Complexity of the Separable Hamiltonian ProblemAndré Chailloux, Or Sattath. 32-41 [doi]
- Quantum Money with Classical VerificationDmitry Gavinsky. 42-52 [doi]
- On the Usefulness of PredicatesPer Austrin, Johan Håstad. 53-63 [doi]
- Reductions between Expansion ProblemsPrasad Raghavendra, David Steurer, Madhur Tulsiani. 64-73 [doi]
- On Problems as Hard as CNF-SATMarek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström. 74-84 [doi]
- Testing List H-homomorphismsYuichi Yoshida. 85-95 [doi]
- A Dichotomy for Real Weighted Holant ProblemsSangxia Huang, Pinyan Lu. 96-106 [doi]
- A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary BasisKazuhisa Seto, Suguru Tamaki. 107-116 [doi]
- Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SATPaul Beame, Russell Impagliazzo, Srikanth Srinivasan. 117-125 [doi]
- DNF Sparsification and a Faster Deterministic Counting AlgorithmParikshit Gopalan, Raghu Meka, Omer Reingold. 126-135 [doi]
- Communication Complexity and Information Complexity: Foundations and New DirectionsToniann Pitassi. 136 [doi]
- Gaussian Noise Sensitivity and Fourier TailsGuy Kindler, Ryan O'Donnell. 137-147 [doi]
- Junto-Symmetric Functions, Hypergraph Isomorphism and CrunchingSourav Chakraborty, Eldar Fischer, David García-Soriano, Arie Matsliah. 148-158 [doi]
- Complexity Lower Bounds through Balanced Graph PropertiesGuy Moshkovitz. 159-169 [doi]
- Limitations of Lower-Bound Methods for the Wire Complexity of Boolean OperatorsAndrew Drucker. 170-180 [doi]
- Limits on Alternation-Trading Proofs for Time-Space Lower BoundsSamuel R. Buss, Ryan Williams. 181-191 [doi]
- The Hardness of Being PrivateAnil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, Toniann Pitassi. 192-202 [doi]
- Matrix Isomorphism of Matrix Lie AlgebrasJoshua A. Grochow. 203-213 [doi]
- On Sunflowers and Matrix MultiplicationNoga Alon, Amir Shpilka, Christopher Umans. 214-223 [doi]
- Algebras of Minimal Multiplicative ComplexityMarkus Bläser, Bekhan Chokaev. 224-234 [doi]
- Prospects for Geometric Complexity TheoryPeter Bürgisser. 235 [doi]
- A Strong Direct Product Theorem for Quantum Query ComplexityTroy Lee, Jérémie Roland. 236-246 [doi]
- A Strong Parallel Repetition Theorem for Projection Games on ExpandersRan Raz, Ricky Rosen. 247-257 [doi]
- Share Conversion and Private Information RetrievalAmos Beimel, Yuval Ishai, Eyal Kushilevitz, Ilan Orlov. 258-268 [doi]
- Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin GamesBaris Aydinlioglu, Dieter van Melkebeek. 269-279 [doi]
- Hitting Set Generators for Sparse Polynomials over Any Finite FieldsChi-Jen Lu. 280-286 [doi]
- Pseudorandom Generators for Read-Once ACC^0Dmitry Gavinsky, Shachar Lovett, Srikanth Srinivasan. 287-297 [doi]
- Non-malleable Extractors with Short Seeds and Applications to Privacy AmplificationGil Cohen, Ran Raz, Gil Segev. 298-308 [doi]
- Better Condensers and New Extractors from Parvaresh-Vardy CodesAmnon Ta-Shma, Christopher Umans. 309-315 [doi]
- List Decoding Barnes-Wall LatticesElena Grigorescu, Chris Peikert. 316-325 [doi]
- Space-Efficient Algorithms for Reachability in Surface-Embedded GraphsDerrick Stolee, N. V. Vinodchandran. 326-333 [doi]
- Space Complexity in Polynomial CalculusYuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi. 334-344 [doi]
- Combinatorial PCPs with Short ProofsOr Meir. 345-355 [doi]