Media Summary: Lattice Problems Beyond Polynomial Time. Divesh Aggarwal (National University of Singapore); Huck Bennett (Oregon State ... Generic Reed-Solomon codes achieve list-decoding capacity. Joshua Brakensiek (Stanford University); Sivakanth Gopi (Microsoft ... A High Dimensional Goldreich-Levin Theorem. Parker Newton, Silas Richelson, Chase Wilson (University of California, Riverside)
Stoc 2023 Session 9a Approximate - Detailed Analysis & Overview
Lattice Problems Beyond Polynomial Time. Divesh Aggarwal (National University of Singapore); Huck Bennett (Oregon State ... Generic Reed-Solomon codes achieve list-decoding capacity. Joshua Brakensiek (Stanford University); Sivakanth Gopi (Microsoft ... A High Dimensional Goldreich-Levin Theorem. Parker Newton, Silas Richelson, Chase Wilson (University of California, Riverside) A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. Omar Alrabiah, Venkatesan ... New Subset Selection Algorithms for Low Rank Quantum Advantage from Any Non-Local Game. Yael Kalai (Microsoft Research and MIT); Alex Lombardi (Simons Institute and ...
Quantum Cryptography in Algorithmica. William Kretschmer (UT Austin); Luowen Qian (Boston University); Makrand Sinha ... Algorithms approaching the threshold for semi-random planted clique. Rares-Darius Buhai (ETH Zurich); Pravesh K. Kothari ...
