Abstract is missing.
- Optimal Tiling of the Euclidean Space Using Permutation-Symmetric BodiesMark Braverman, Dor Minzer. [doi]
- The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and ApplicationsAlexander Golovnev, Ishay Haviv. [doi]
- Junta Distance Approximation with Sub-Exponential QueriesVishnu Iyer, Avishay Tal, Michael Whitmeyer. [doi]
- Fractional Pseudorandom Generators from Any Fourier LevelEshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty. [doi]
- Error Reduction for Weighted PRGs Against Read Once Branching ProgramsGil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma. [doi]
- Fourier Growth of Parity Decision TreesUma Girish, Avishay Tal, Kewen Wu 0001. [doi]
- Hitting Sets and Reconstruction for Dense Orbits in VP_{e} and ΣΠΣ CircuitsDori Medini, Amir Shpilka. [doi]
- SOS Lower Bound for Exact Planted CliqueShuo Pang. [doi]
- Polynomial Time Algorithms in Invariant Theory for Torus ActionsPeter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson. [doi]
- On Query-To-Communication Lifting for Adversary BoundsAnurag Anshu, Shalev Ben-David, Srijita Kundu. [doi]
- Proof Complexity of Natural Formulas via Communication ArgumentsDmitry Itsykson, Artur Riazanov. [doi]
- Separating ABPs and Some Structured Formulas in the Non-Commutative SettingPrerona Chatterjee. [doi]
- A Simple Proof of a New Set Disjointness with Applications to Data StreamsAkshay Kamath, Eric Price, David P. Woodruff. [doi]
- Toward Better Depth Lower Bounds: The XOR-KRW ConjectureIvan Mihajlin, Alexander Smal. [doi]
- On the Cut Dimension of a GraphTroy Lee, Tongyang Li, Miklos Santha, Shengyu Zhang. [doi]
- Communication Complexity with Defective RandomnessMarshall Ball, Oded Goldreich 0001, Tal Malkin. [doi]
- On the Complexity of Evaluating Highest Weight VectorsMarkus Bläser, Julian Dörfler, Christian Ikenmeyer. [doi]
- A Direct Product Theorem for One-Way Quantum CommunicationRahul Jain 0001, Srijita Kundu. [doi]
- A Majority Lemma for Randomised Query ComplexityMika Göös, Gilbert Maystre. [doi]
- On p-Group Isomorphism: Search-To-Decision, Counting-To-Decision, and Nilpotency Class Reductions via TensorsJoshua A. Grochow, Youming Qiao. [doi]
- Hardness of Constant-Round Communication ComplexityShuichi Hirahara, Rahul Ilango, Bruno Loff. [doi]
- Robustly Self-Ordered Graphs: Constructions and Applications to Property TestingOded Goldreich 0001, Avi Wigderson. [doi]
- Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract)Edward Pyne, Salil P. Vadhan. [doi]
- Shadows of Newton PolytopesPavel Hrubes, Amir Yehudayoff. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Matrix Rigidity Depends on the Target FieldLászló Babai, Bohdan Kivva. [doi]
- On the Power and Limitations of Branch and CutNoah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson. [doi]
- A Lower Bound on Determinantal ComplexityMrinal Kumar 0001, Ben lee Volk. [doi]
- Quantum Complexity of Minimum CutSimon Apers, Troy Lee. [doi]
- GSF-Locality Is Not Sufficient For Proximity-Oblivious TestingIsolde Adler, Noleen Köhler, Pan Peng 0001. [doi]
- The Power of Negative ReasoningSusanna F. de Rezende, Massimo Lauria, Jakob Nordström, Dmitry Sokolov 0001. [doi]
- Deterministic Identity Testing Paradigms for Bounded Top-Fanin Depth-4 CircuitsPranjal Dutta, Prateek Dwivedi, Nitin Saxena 0001. [doi]
- Hardness of KT Characterizes Parallel CryptographyHanlin Ren, Rahul Santhanam. [doi]
- A Lower Bound for Polynomial Calculus with Extension RuleYaroslav Alekseev. [doi]
- Barriers for Recent Methods in Geodesic OptimizationWilliam Cole Franks, Philipp Reichenbach. [doi]
- A Stress-Free Sum-Of-Squares Lower Bound for ColoringPravesh K. Kothari, Peter Manohar. [doi]
- Variety Evasive Subspace FamiliesZeyu Guo. [doi]
- Branching Programs with Bounded Repetitions and Flow FormulasAnastasia Sofronova, Dmitry Sokolov 0001. [doi]
- Arithmetic Circuit Complexity of Division and TruncationPranjal Dutta, Gorav Jindal, Anurag Pandey 0001, Amit Sinhababu. [doi]
- Rate Amplification and Query-Efficient Distance Amplification for Linear LCC and LDCGil Cohen, Tal Yankovitz. [doi]
- On the Pseudo-Deterministic Query Complexity of NP Search ProblemsShafi Goldwasser, Russell Impagliazzo, Toniann Pitassi, Rahul Santhanam. [doi]
- An Improved Protocol for the Exactly-N ProblemNati Linial, Adi Shraibman. [doi]