Media Summary: Lattice Problems Beyond Polynomial Time. Divesh Aggarwal (National University of Singapore); Huck Bennett (Oregon State ... A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. Omar Alrabiah, Venkatesan ... Generic Reed-Solomon codes achieve list-decoding capacity. Joshua Brakensiek (Stanford University); Sivakanth Gopi (Microsoft ...
Stoc 2023 Session 9a Approximate - Detailed Analysis & Overview
Lattice Problems Beyond Polynomial Time. Divesh Aggarwal (National University of Singapore); Huck Bennett (Oregon State ... A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. Omar Alrabiah, Venkatesan ... Generic Reed-Solomon codes achieve list-decoding capacity. Joshua Brakensiek (Stanford University); Sivakanth Gopi (Microsoft ... New Subset Selection Algorithms for Low Rank A High Dimensional Goldreich-Levin Theorem. Parker Newton, Silas Richelson, Chase Wilson (University of California, Riverside) Sum-of-Squares Lower Bounds for Densest k-Subgraph. Chris Jones (Bocconi University); Aaron Potechin (University of Chicago) ...
Quantum Cryptography in Algorithmica. William Kretschmer (UT Austin); Luowen Qian (Boston University); Makrand Sinha ... Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Due to technical difficulties, Yitong Yin's slides were not displayed correctly. Another version of his talk is available here: ... Parallel Discrete Sampling via Continuous Walks. Nima Anari (Stanford University); Yizhi Huang (Tsinghua University); Tianyu Liu ...
