Abstract is missing.
- Random Arithmetic Formulas Can Be Reconstructed EfficientlyAnkit Gupta 0001, Neeraj Kayal, Youming Qiao. 1-9 [doi]
- Formulas are Exponentially Stronger than Monotone Circuits in Non-commutative SettingPavel Hrubes, Amir Yehudayoff. 10-14 [doi]
- On Medium-Uniformity and Circuit Lower BoundsRahul Santhanam, Ryan Williams. 15-23 [doi]
- Towards a Reverse Newman's Theorem in Interactive Information ComplexityJoshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolay K. Vereshchagin. 24-33 [doi]
- Shared Randomness and Quantum Communication in the Multi-party ModelDmitry Gavinsky, Tsuyoshi Ito, Guoming Wang. 34-43 [doi]
- On the Power of Non-adaptive Learning GraphsAleksandrs Belovs, Ansis Rosmanis. 44-55 [doi]
- The Correct Exponent for the Gotsman-Linial ConjectureDaniel M. Kane. 56-64 [doi]
- Approaching the Chasm at Depth FourAnkit Gupta 0001, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi. 65-73 [doi]
- Approximating Boolean Functions with Depth-2 CircuitsEric Blais, Li-Yang Tan. 74-85 [doi]
- Constructing Hard Functions Using Learning AlgorithmsAdam Klivans, Pravesh Kothari, Igor C. Oliveira. 86-97 [doi]
- Short Lists with Short Programs in Short TimeBruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand. 98-108 [doi]
- Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole PrincipleAlbert Atserias, Moritz Müller, Sergi Oliva. 109-120 [doi]
- LS+ Lower Bounds from Pairwise IndependenceMadhur Tulsiani, Pratik Worah. 121-132 [doi]
- Just a Pebble GameSiu Man Chan. 133-143 [doi]
- Quantum XOR GamesOded Regev, Thomas Vidick. 144-155 [doi]
- Two-Message Quantum Interactive Proofs and the Quantum Separability ProblemPatrick Hayden, Kevin Milner, Mark M. Wilde. 156-167 [doi]
- Collapse of the Hierarchy of Constant-Depth Exact Quantum CircuitsYasuhiro Takahashi, Seiichiro Tani. 168-178 [doi]
- How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions?Andris Ambainis, Ronald de Wolf. 179-184 [doi]
- Composition Limits and Separating Examples for Some Boolean Function Complexity MeasuresJustin Gilmer, Michael Saks, Srikanth Srinivasan. 185-196 [doi]
- On Rigid Matrices and U-polynomialsNoga Alon, Gil Cohen. 197-206 [doi]
- Covering CSPsIrit Dinur, Gillat Kol. 207-218 [doi]
- Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex CoverSushant Sachdeva, Rishi Saket. 219-229 [doi]
- On the Lattice Smoothing Parameter ProblemKai-Min Chung, Daniel Dadush, Feng-Hao Liu, Chris Peikert. 230-241 [doi]
- A Derandomized Switching Lemma and an Improved Derandomization of AC0Luca Trevisan, Tongke Xue. 242-247 [doi]
- The Distinguishability of Product Distributions by Read-Once Branching ProgramsJohn P. Steinberger. 248-254 [doi]
- Strong LTCs with Inverse Polylogarithmic Rate and SoundnessMichael Viderman. 255-265 [doi]
- On the Parameterized and Approximation Hardness of Metric DimensionSepp Hartung, André Nichterlein. 266-276 [doi]
- An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar ReachabilityTatsuya Imai, Kotaro Nakagawa, Aduri Pavan, N. V. Vinodchandran, Osamu Watanabe. 277-286 [doi]
- Superlinear Lower Bounds for Multipass Graph ProcessingVenkatesan Guruswami, Krzysztof Onak. 287-298 [doi]