1. Home
  2. Proceedings
  3. FOCS
  4. FOCS 2023
Default Cover Image

2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)

Nov. 6 2023 to Nov. 9 2023

Santa Cruz, CA, USA

ISBN: 979-8-3503-1894-4

Table of Contents

Title Page IFreely available from IEEE.pp. 1-1
Title Page IIIFreely available from IEEE.pp. 3-3
CopyrightFreely available from IEEE.pp. 4-4
Table of ContentsFreely available from IEEE.pp. 5-19
PrefaceFreely available from IEEE.pp. 20-20
OrganizersFreely available from IEEE.pp. 21-21
Program CommitteeFreely available from IEEE.pp. 22-23
Graph Colouring Is Hard on Average for Polynomial Calculus and NullstellensatzFull-text access may be available. Sign in or learn about subscription options.pp. 1-11
by Jonas Conneryd, Susanna F. De Rezende, Jakob Nordström, Shuo Pang, Kilian Risse
Clique Is Hard on Average for Unary Sherali-AdamsFull-text access may be available. Sign in or learn about subscription options.pp. 12-25
by Susanna F. De Rezende, Aaron Potechin, Kilian Risse
On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPsFull-text access may be available. Sign in or learn about subscription options.pp. 26-36
by Suprovat Ghoshal, Euiwoong Lee
On small-depth Frege proofs for PHPFull-text access may be available. Sign in or learn about subscription options.pp. 37-49
by Johan Håstad
Thin Trees for Laminar FamiliesFull-text access may be available. Sign in or learn about subscription options.pp. 50-59
by Nathan Klein, Neil Olver
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner TreeFull-text access may be available. Sign in or learn about subscription options.pp. 60-76
by Costas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D Ellis Hershkowitz, Rajmohan Rajaraman
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness BarrierFull-text access may be available. Sign in or learn about subscription options.pp. 77-97
by Hung Le, Shay Solomon, Cuong Than
Sub-quadratic (1+ϵ)-approximate Euclidean Spanners, with ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 98-112
by Alexandr Andoni, Hengjie Zhang
Envy-Free Cake-Cutting for Four AgentsFull-text access may be available. Sign in or learn about subscription options.pp. 113-122
by Alexandros Hollender, Aviad Rubinstein
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over TimeFull-text access may be available. Sign in or learn about subscription options.pp. 123-133
by Neil Olver, Leon Sering, Laura Vargas Koch
Simultaneous Auctions are Approximately Revenue-Optimal for Subadditive BiddersFull-text access may be available. Sign in or learn about subscription options.pp. 134-147
by Yang Cai, Ziyun Chen, Jinzhao Wu
Constant Approximation for Private Interdependent ValuationsFull-text access may be available. Sign in or learn about subscription options.pp. 148-163
by Alon Eden, Michal Feldman, Kira Goldner, Simon Mauras, Divyarthi Mohan
Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size AlphabetsFull-text access may be available. Sign in or learn about subscription options.pp. 164-176
by Zeyu Guo, Zihan Zhang
A proof that Reed-Muller codes achieve Shannon capacity on symmetric channelsFull-text access may be available. Sign in or learn about subscription options.pp. 177-193
by Emmanuel Abbe, Colin Sandon
Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary CodesFull-text access may be available. Sign in or learn about subscription options.pp. 194-205
by Silas Richelson, Sourya Roy
Optimal Testing of Generalized Reed-Muller Codes in Fewer QueriesFull-text access may be available. Sign in or learn about subscription options.pp. 206-233
by Dor Minzer, Kai Zhe Zheng
Separating MAX 2-AND, MAX DI-CUT and MAX CUTFull-text access may be available. Sign in or learn about subscription options.pp. 234-252
by Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick
Triplet Reconstruction and all other Phylogenetic CSPs are Approximation ResistantFull-text access may be available. Sign in or learn about subscription options.pp. 253-284
by Vaggos Chatziafratis, Konstantin Makarychev
Improved Hardness of Approximating k-Clique under ETHFull-text access may be available. Sign in or learn about subscription options.pp. 285-306
by Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang
Efficient Algorithms for Semirandom Planted CSPs at the Refutation ThresholdFull-text access may be available. Sign in or learn about subscription options.pp. 307-327
by Venkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter Manohar
The minimal canonical form of a tensor networkFull-text access may be available. Sign in or learn about subscription options.pp. 328-362
by Arturo Acuaviva, Visu Makam, Harold Nieuwboer, David Pérez-García, Friedrich Sittner, Michael Walter, Freek Witteveen
Query-optimal estimation of unitary channels in diamond distanceFull-text access may be available. Sign in or learn about subscription options.pp. 363-390
by Jeongwan Haah, Robin Kothari, Ryan O’Donnell, Ewin Tang
When Does Adaptivity Help for Quantum State Learning?Full-text access may be available. Sign in or learn about subscription options.pp. 391-404
by Sitan Chen, Brice Huang, Jerry Li, Allen Liu, Mark Sellke
Exponential quantum speedup in simulating coupled classical oscillators*Full-text access may be available. Sign in or learn about subscription options.pp. 405-414
by Ryan Babbush, Dominic W. Berry, Robin Kothari, Rolando D. Somma, Nathan Wiebe
Attribute-Based Encryption for Circuits of Unbounded Depth from LatticesFull-text access may be available. Sign in or learn about subscription options.pp. 415-434
by Yao-Ching Hsieh, Huijia Lin, Ji Luo
ABE for Circuits with poly (λ) -sized Keys from LWEFull-text access may be available. Sign in or learn about subscription options.pp. 435-446
by Valerio Cini, Hoeteck Wee
Learning in Pessiland via Inductive InferenceFull-text access may be available. Sign in or learn about subscription options.pp. 447-457
by Shuichi Hirahara, Mikito Nanashima
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-AgreementFull-text access may be available. Sign in or learn about subscription options.pp. 458-483
by Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass
A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 484-492
by Ran Duan, Jiayi Mao, Xinkai Shu, Longhui Yin
Faster High Accuracy Multi-Commodity Flow from Single-Commodity TechniquesFull-text access may be available. Sign in or learn about subscription options.pp. 493-502
by Jan van Den Brand, Daniel J. Zhang
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost FlowFull-text access may be available. Sign in or learn about subscription options.pp. 503-514
by Jan Van Den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!Full-text access may be available. Sign in or learn about subscription options.pp. 515-538
by Karl Bringmann, Alejandro Cassis, Nick Fischer
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic CryptographyFull-text access may be available. Sign in or learn about subscription options.pp. 539-555
by Benny Applebaum, Oded Nir
On Pseudolinear Codes for Correcting Adversarial ErrorsFull-text access may be available. Sign in or learn about subscription options.pp. 556-567
by Eric Ruzomberka, Homa Nikbakht, Christopher G. Brinton, H. Vincent Poor
A New Approach to Post-Quantum Non-MalleabilityFull-text access may be available. Sign in or learn about subscription options.pp. 568-579
by Xiao Liang, Omkant Pandey, Takashi Yamakawa
Towards Separating Computational and Statistical Differential PrivacyFull-text access may be available. Sign in or learn about subscription options.pp. 580-599
by Badih Ghazi, Rahul Ilango, Pritish Kamath, Ravi Kumar, Pasin Manurangsi
Bridge Girth: A Unifying Notion in Network DesignFull-text access may be available. Sign in or learn about subscription options.pp. 600-648
by Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi
Planar Disjoint Paths, Treewidth, and KernelsFull-text access may be available. Sign in or learn about subscription options.pp. 649-662
by Michał Włodarczyk, Meirav Zehavi
Flip-width: Cops and Robber on dense graphsFull-text access may be available. Sign in or learn about subscription options.pp. 663-700
by Szymon Toruńczyk
Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n BarrierFull-text access may be available. Sign in or learn about subscription options.pp. 701-720
by Greg Bodwin, Gary Hoppenworth
Fourier Growth of Communication Protocols for XOR FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 721-732
by Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu
SAT Reduces to the Minimum Circuit Size Problem with a Random OracleFull-text access may be available. Sign in or learn about subscription options.pp. 733-742
by Rahul Ilango
Doubley-Efficient Interactive Proofs for Distribution PropertiesFull-text access may be available. Sign in or learn about subscription options.pp. 743-751
by Tal Herman, Guy Rothblum
IOPs with Inverse Polynomial Soundness ErrorFull-text access may be available. Sign in or learn about subscription options.pp. 752-761
by Gal Arnon, Alessandro Chiesa, Eylon Yogev
Lipschitz Continuous Algorithms for Graph ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 762-797
by Soh Kumabe, Yuichi Yoshida
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman RefinementsFull-text access may be available. Sign in or learn about subscription options.pp. 798-809
by Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
Strong Spatial Mixing for Colorings on Trees and its Algorithmic ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 810-845
by Zongchen Chen, Kuikui Liu, Nitya Mani, Ankur Moitra
Singular Value Approximation and Sparsifying Random Walks on Directed GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 846-854
by AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil Vadhan
Improved Streaming Algorithms for Maximum Directed Cut via Smoothed SnapshotsFull-text access may be available. Sign in or learn about subscription options.pp. 855-870
by Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan, Santhoshini Velusamy
Streaming Lower Bounds and Asymmetric Set-DisjointnessFull-text access may be available. Sign in or learn about subscription options.pp. 871-882
by Shachar Lovett, Jiapeng Zhang
Streaming Euclidean k-median and k-means with o(log n) SpaceFull-text access may be available. Sign in or learn about subscription options.pp. 883-908
by Vincent Cohen-Addad, David P. Woodruff, Samson Zhou
Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate MatchingsFull-text access may be available. Sign in or learn about subscription options.pp. 909-932
by Sepehr Assadi, Janani Sundaresan
Strong Bounds for 3-ProgressionsFull-text access may be available. Sign in or learn about subscription options.pp. 933-973
by Zander Kelley, Raghu Meka
The Subspace Flatness Conjecture and Faster Integer ProgrammingFull-text access may be available. Sign in or learn about subscription options.pp. 974-988
by Victor Reis, Thomas Rothvoss
Certified Hardness vs. Randomness for Log-SpaceFull-text access may be available. Sign in or learn about subscription options.pp. 989-1007
by Edward Pyne, Ran Raz, Wei Zhan
Derandomization vs Refutation: A Unified Framework for Characterizing DerandomizationFull-text access may be available. Sign in or learn about subscription options.pp. 1008-1047
by Lijie Chen, Roei Tell, Ryan Williams
Top-Down Lower Bounds for Depth-Four CircuitsFull-text access may be available. Sign in or learn about subscription options.pp. 1048-1055
by Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov
Toward Better Depth Lower Bounds: A KRW-like theorem for Strong CompositionFull-text access may be available. Sign in or learn about subscription options.pp. 1056-1081
by Or Meir
Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation ClusteringFull-text access may be available. Sign in or learn about subscription options.pp. 1082-1104
by Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman
Deterministic Clustering in High Dimensional Spaces: Sketches and ApproximationFull-text access may be available. Sign in or learn about subscription options.pp. 1105-1130
by Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn
The Price of Explainability for ClusteringFull-text access may be available. Sign in or learn about subscription options.pp. 1131-1148
by Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan
Agnostic proper learning of monotone functions: beyond the black-box correction barrierFull-text access may be available. Sign in or learn about subscription options.pp. 1149-1170
by Jane Lange, Arsen Vasilyan
Near Optimal Memory-Regret Tradeoff for Online LearningFull-text access may be available. Sign in or learn about subscription options.pp. 1171-1194
by Binghui Peng, Aviad Rubinstein
Tight Time-Space Lower Bounds for Constant-Pass LearningFull-text access may be available. Sign in or learn about subscription options.pp. 1195-1202
by Xin Lyu, Avishay Tal, Hongxun Wu, Junzhao Yang
Optimal PAC Bounds without Uniform ConvergenceFull-text access may be available. Sign in or learn about subscription options.pp. 1203-1223
by Ishaq Aden-Ali, Yeshwanth Cherapanamjeri, Abhishek Shetty, Nikita Zhivotovskiy
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and ShortcuttingFull-text access may be available. Sign in or learn about subscription options.pp. 1224-1239
by Lijie Chen, William M. Hoza, Xin Lyu, Avishay Tal, Hongxun Wu
Explicit orthogonal and unitary designsFull-text access may be available. Sign in or learn about subscription options.pp. 1240-1260
by Ryan O’Donnell, Rocco A. Servedio, Pedro Paredes
Polynomial-Time Pseudodeterministic Construction of PrimesFull-text access may be available. Sign in or learn about subscription options.pp. 1261-1270
by Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam
Two Source Extractors for Asymptotically Optimal Entropy, and (Many) MoreFull-text access may be available. Sign in or learn about subscription options.pp. 1271-1281
by Xin Li
Traversing combinatorial 0/1-polytopes via optimizationFull-text access may be available. Sign in or learn about subscription options.pp. 1282-1291
by Arturo Merino, Torsten Mütze
The Vector Balancing Constant for ZonotopesFull-text access may be available. Sign in or learn about subscription options.pp. 1292-1300
by Rainie Bozzai, Victor Reis, Thomas Rothvoss
A deterministic near-linear time approximation scheme for geometric transportationFull-text access may be available. Sign in or learn about subscription options.pp. 1301-1315
by Emily Fox, Jiashuai Lu
Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyondFull-text access may be available. Sign in or learn about subscription options.pp. 1316-1336
by Nathaniel Johnston, Benjamin Lovitz, Aravindan Vijayaraghavan
Parallel Repetition for the GHZ Game: Exponential DecayFull-text access may be available. Sign in or learn about subscription options.pp. 1337-1341
by Mark Braverman, Subhash Khot, Dor Minzer
Bounding the Quantum Value of Compiled Nonlocal Games: From CHSH to BQP VerificationFull-text access may be available. Sign in or learn about subscription options.pp. 1342-1348
by Anand Natarajan, Tina Zhang
stateQIP = statePSPACEFull-text access may be available. Sign in or learn about subscription options.pp. 1349-1356
by Tony Metger, Henry Yuen
Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple PolygonFull-text access may be available. Sign in or learn about subscription options.pp. 1357-1365
by Reilly Browne, Prahlad Narasimham Kasthurirangan, Joseph S. B. Mitchell, Valentin Polishchuk
Improved Approximations for Vector Bin Packing via Iterative Randomized RoundingFull-text access may be available. Sign in or learn about subscription options.pp. 1366-1376
by Ariel Kulik, Matthias Mnich, Hadas Shachnai
Parameterized Approximation Schemes for Clustering with General Norm ObjectivesFull-text access may be available. Sign in or learn about subscription options.pp. 1377-1399
by Fateme Abbasi, Sandip Banerjee, Jarosław Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Memory-Query Tradeoffs for Randomized Convex OptimizationFull-text access may be available. Sign in or learn about subscription options.pp. 1400-1413
by Xi Chen, Binghui Peng
Quartic Samples Suffice for Fourier InterpolationFull-text access may be available. Sign in or learn about subscription options.pp. 1414-1425
by Zhao Song, Baocheng Sun, Omri Weinstein, Ruizhe Zhang
Fast Numerical Multivariate Multipoint EvaluationFull-text access may be available. Sign in or learn about subscription options.pp. 1426-1439
by Sumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar, Ramprasad Saptharishi
Locally Uniform HashingFull-text access may be available. Sign in or learn about subscription options.pp. 1440-1470
by Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup
Generalizations of Matrix Multiplication can solve the Light Bulb ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 1471-1495
by Josh Alman, Hengjie Zhang
Tight Space Lower Bound for Pseudo-Deterministic Approximate CountingFull-text access may be available. Sign in or learn about subscription options.pp. 1496-1504
by Ofer Grossman, Meghal Gupta, Mark Sellke
Extracting Randomness from Samplable Distributions, RevisitedFull-text access may be available. Sign in or learn about subscription options.pp. 1505-1514
by Marshall Ball, Eli Goldin, Dana Dachman-Soled, Saachi Mutreja
Pseudorandom Hashing for Space-bounded Computation with Applications in StreamingFull-text access may be available. Sign in or learn about subscription options.pp. 1515-1550
by Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff
Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise IndependenceFull-text access may be available. Sign in or learn about subscription options.pp. 1551-1562
by Mohsen Ghaffari, Christoph Grunau, Václav Rozhoň
Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update TimeFull-text access may be available. Sign in or learn about subscription options.pp. 1563-1588
by Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
Super-Logarithmic Lower Bounds for Dynamic Graph ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 1589-1604
by Kasper Green Larsen, Huacheng Yu
The Complexity of Dynamic Least-Squares RegressionFull-text access may be available. Sign in or learn about subscription options.pp. 1605-1627
by Shunhua Jiang, Binghui Peng, Omri Weinstein
Approximating Edit Distance in the Fully Dynamic ModelFull-text access may be available. Sign in or learn about subscription options.pp. 1628-1638
by Tomasz Kociumaka, Anish Mukherjee, Barna Saha
From Grassmannian to Simplicial High-Dimensional ExpandersFull-text access may be available. Sign in or learn about subscription options.pp. 1639-1648
by Louis Golowich
Showing 100 out of 150
Load More
Load All