Abstract is missing.
- Dimension Reduction for Polynomials over Gaussian Space and ApplicationsBadih Ghazi, Pritish Kamath, Prasad Raghavendra. [doi]
- Lossless Dimension Expanders via Linearized Polynomials and Subspace DesignsVenkatesan Guruswami, Nicolas Resch, Chaoping Xing. [doi]
- Hardness vs Randomness for Bounded Depth Arithmetic CircuitsChi-Ning Chou, Mrinal Kumar, Noam Solomon. [doi]
- Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic CircuitsNoga Alon, Mrinal Kumar, Ben lee Volk. [doi]
- Worst-Case to Average Case Reductions for the Distance to a CodeEli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf. [doi]
- A Tight Lower Bound for Entropy FlatteningYi-Hsiu Chen, Mika Göös, Salil P. Vadhan, Jiapeng Zhang. [doi]
- Communication Complexity with Small AdvantageThomas Watson. [doi]
- Hardness of Function Composition for Semantic Read once Branching ProgramsJeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi. [doi]
- The Power of Natural Properties as OraclesRussell Impagliazzo, Valentine Kabanets, Ilya Volkovich. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from SunflowersSivaramakrishnan Natarajan Ramamoorthy, Anup Rao. [doi]
- Pseudorandom Generators from Polarizing Random WalksEshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett. [doi]
- Algebraic Dependencies and PSPACE Algorithms in Approximative ComplexityZeyu Guo, Nitin Saxena 0001, Amit Sinhababu. [doi]
- Two-Player Entangled Games are NP-HardAnand Natarajan, Thomas Vidick. [doi]
- Hardness Amplification for Non-Commutative Arithmetic CircuitsMarco L. Carmosino, Russell Impagliazzo, Shachar Lovett, Ivan Mihajlin. [doi]
- Linear Sketching over F_2Sampath Kannan, Elchanan Mossel, Swagato Sanyal, Grigory Yaroslavtsev. [doi]
- New Hardness Results for the Permanent Using Linear OpticsDaniel Grier, Luke Schaeffer. [doi]
- Complexity Classification of Conjugated Clifford CircuitsAdam Bouland, Joseph F. Fitzsimons, Dax Enshan Koh. [doi]
- Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depthAndrzej Lingas. [doi]
- Efficient Batch Verification for UPOmer Reingold, Guy N. Rothblum, Ron D. Rothblum. [doi]
- Testing Linearity against Non-Signaling StrategiesAlessandro Chiesa, Peter Manohar, Igor Shinkar. [doi]
- NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD CircuitsShuichi Hirahara, Igor Carboni Oliveira, Rahul Santhanam. [doi]
- On the Complexity of the Cayley Semigroup Membership ProblemLukas Fleischer. [doi]
- On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner ProductLijie Chen. [doi]
- Earthmover Resilience and Testing in Ordered StructuresOmri Ben-Eliezer, Eldar Fischer. [doi]
- A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in nDaniel Kane, Sankeerth Rao. [doi]
- Limits on Representing Boolean Functions by Linear Combinations of Simple Functions: Thresholds, ReLUs, and Low-Degree PolynomialsRichard Ryan Williams. [doi]
- Reordering Rule Makes OBDD Proof Systems StrongerSam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov. [doi]
- A New Approach for Constructing Low-Error, Two-Source ExtractorsAvraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li 0006, Amnon Ta-Shma. [doi]