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.
The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True
Strassen’s asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true, most notably ...
A Stronger Connection between the Asymptotic Rank Conjecture and the Set Cover Conjecture
We give a short proof that Strassen’s asymptotic rank conjecture implies that for every ε > 0 there exists a (3/22/3 + ε)n-time algorithm for set cover on a universe of size n with sets of bounded size. This strengthens and simplifies a recent result of ...
Equality Cases of the Alexandrov–Fenchel Inequality Are Not in the Polynomial Hierarchy
Describing the equality conditions of the Alexandrov–Fenchel inequality has been a major open problem for decades. We prove that for a natural class of convex polytopes, the equality cases of the AF inequality are not in unless the polynomial hierarchy ...
Semigroup Algorithmic Problems in Metabelian Groups
We consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum'aki (2005): the Identity Problem (does a semigroup contain a neutral element?), the Group ...
The Complexity of Computing KKT Solutions of Quadratic Programs
It is well known that solving a (non-convex) quadratic program is NP-hard. We show that the problem remains hard even if we are only looking for a Karush-Kuhn-Tucker (KKT) point, instead of a global optimum. Namely, we prove that computing a KKT point of ...
Minimum Star Partitions of Simple Polygons in Polynomial Time
We devise a polynomial-time algorithm for partitioning a simple polygon P into a minimum number of star-shaped polygons. The question of whether such an algorithm exists has been open for more than four decades [Avis and Toussaint, Pattern Recognit., ...
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% |