The papers in this volume were presented at the 56th Annual ACM Symposium on Theory of Computing (STOC 2024), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). The conference was held in Vancouver, Canada, June 24--28, 2024, with the papers being presented as live talks.
Product Mixing in Compact Lie Groups
If G is a group, we say a subset S of G is product-free if the equation xy=z has no solutions with x,y,z ∈ S.In 1985, Babai and Sós [] asked, for a finite group G, how large a subset S⊆ G can be if it is product-free. The main tool (hitherto) for ...
On Approximability of Satisfiable k-CSPs: IV
We prove a stability result for general 3-wise correlations over distributions satisfying mild connectivity properties. More concretely, we show that if Σ,Γ and Φ are alphabets of constant size, and µ is a distribution over Σ×Γ×Φ satisfying: (1) the ...
Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
Motivated by the inapproximability of reconfiguration problems, we present a new PCP-type characterization of PSPACE, which we call a probabilistically checkable reconfiguration proof (PCRP): Any PSPACE computation can be encoded into an exponentially ...
Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes
We show that cosystolic expansion of sheaves on posets can be derived from local expansion conditions of the sheaf and the poset. When the poset at hand is a cell complex — typically a high dimensional expander — a sheaf may be thought of as generalizing ...
Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields
Reed–Solomon codes are a classic family of error-correcting codes consisting of evaluations of low-degree polynomials over a finite field on some sequence of distinct field elements. They are widely known for their optimal unique-decoding capabilities, ...
Index Terms
- Proceedings of the 56th Annual ACM Symposium on Theory of Computing
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
STOC '15 | 347 | 93 | 27% |
STOC '14 | 319 | 91 | 29% |
STOC '13 | 360 | 100 | 28% |
STOC '11 | 304 | 84 | 28% |
STOC '08 | 325 | 80 | 25% |
STOC '03 | 270 | 80 | 30% |
STOC '02 | 287 | 91 | 32% |
STOC '01 | 230 | 83 | 36% |
STOC '00 | 182 | 85 | 47% |
STOC '98 | 169 | 75 | 44% |
STOC '97 | 211 | 75 | 36% |
STOC '96 | 201 | 74 | 37% |
STOC '89 | 196 | 56 | 29% |
STOC '88 | 192 | 53 | 28% |
STOC '87 | 165 | 50 | 30% |
STOC '80 | 125 | 47 | 38% |
STOC '79 | 111 | 37 | 33% |
STOC '78 | 120 | 38 | 32% |
STOC '77 | 87 | 31 | 36% |
STOC '76 | 83 | 30 | 36% |
STOC '75 | 87 | 31 | 36% |
STOC '74 | 95 | 35 | 37% |
STOC '71 | 50 | 23 | 46% |
STOC '70 | 70 | 27 | 39% |
Overall | 4,586 | 1,469 | 32% |