Media Summary: Algorithms approaching the threshold for semi-random planted clique. Rares-Darius Buhai (ETH Zurich); Pravesh K. Kothari ... New Subset Selection Algorithms for Low Rank Approximation: Offline and Online. David P. Woodruff, Taisuke Yasuda (Carnegie ... Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. Timothy ...
Stoc 2023 Session10c The Smoothed - Detailed Analysis & Overview
Algorithms approaching the threshold for semi-random planted clique. Rares-Darius Buhai (ETH Zurich); Pravesh K. Kothari ... New Subset Selection Algorithms for Low Rank Approximation: Offline and Online. David P. Woodruff, Taisuke Yasuda (Carnegie ... Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. Timothy ... Certified Randomness from Quantum Supremacy. Scott Aaronson, Shih-Han Hung (UT Austin) Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic and Fast. Bernhard Haeupler (Carnegie Mellon ... The Power of Unentangled Quantum Proofs with Non-negative Amplitudes. Fernando Granha Jeronimo, Pei Wu (IAS)
Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse. Ravishankar Krishnaswamy (Microsoft ... Approximating Iterated Multiplication of Stochastic Matrices in Small Space. Gil Cohen (Tel Aviv University); Dean Doron (Ben ... Multidimensional Quantum Walks, with Application to k-Distinctness. Stacey Jeffery, Sebastian Zur (CWI & QuSoft) Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic. Jiatu Li (Tsinghua University); Igor C. Oliveira ... Subsampling Suffices for Adaptive Data Analysis. Guy Blanc (Stanford University)
