2024 Proceeding- General Chairs:
- Bojan Mohar,
- Igor Shinkar,
- Program Chair:
- Ryan O'Donnell
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.
Strong Algebras and Radical Sylvester-Gallai Configurations
In this paper, we study the following non-linear generalization of the classical Sylvester-Gallai configuration. Let K be an algebraically closed field of characteristic 0 and F={F1,…,Fm} ⊂ K[x1,…,xN] be a set of irreducible homogeneous polynomials of ...
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time
Rational Identity Testing (RIT) is the decision problem of determining whether or not a noncommutative rational formula computes zero in the free skew field. It admits a deterministic polynomial-time white-box algorithm [Garg, Gurvits, Oliveira, and ...
The Minimal Faithful Permutation Degree of Groups without Abelian Normal Subgroups
Cayley’s theorem says that every finite group G can be viewed as a subgroup of a symmetric group Sm for some integer m. The minimal faithful permutation degree µ(G) of a finite group G is the smallest integer m such that there is an injective ...
Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring
The border, or the approximative, model of algebraic computation (VP) is quite popular due to the Geometric Complexity Theory (GCT) approach to P≠NP conjecture, and its complex analytic origins. On the flip side, the definition of the border is ...
On the Power of Homogeneous Algebraic Formulas
Proving explicit lower bounds on the size of algebraic formulas is a long-standing open problem in the area of algebraic complexity theory. Recent results in the area (e.g. a lower bound against constant-depth algebraic formulas due to Limaye, Srinivasan,...
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% |