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.
Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography
A recent line of research has introduced a systematic approach to exploring the complexity of explicit construction problems through the use of meta-problems, namely, the range avoidance problem (abbrev. Avoid) and the remote point problem (abbrev. ). ...
Communication Lower Bounds for Collision Problems via Density Increment Arguments
Collision problems are important problems in complexity theory and cryptography with diverse applications. Previous fruitful works have mainly focused on query models. Driven by various applications, several works by Bauer, Farshim and Mazaheri (CRYPTO ...
Lower Bounds for Regular Resolution over Parities
The proof system resolution over parities (Res(⊕)) operates with disjunctions of linear equations (linear clauses) over GF(2); it extends the resolution proof system by incorporating linear algebra over GF(2). Over the years, several exponential lower ...
XOR Lemmas for Communication via Marginal Information
We define the marginal information of a communication protocol, and use it to prove XOR lemmas for communication complexity. We show that if every C-bit protocol has bounded advantage for computing a Boolean function f, then every Ω(C √n)-bit protocol ...
Beating Brute Force for Compression Problems
A compression problem is defined with respect to an efficient encoding function f; given a string x, our task is to find the shortest y such that f(y) = x. The obvious brute-force algorithm for solving this compression task on n-bit strings runs in time ...
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% |