TOCT: Just Accepted

ACM Transactions on Computation TheoryJust Accepted

Just Accepted

The below articles have been recently accepted to the journal and are currently in the production process. These Author’s Accepted Manuscripts (AAM) will be available for preview until the “Version of Record” is available and assigned to its proper issue. The AAM carries the article’s permanent DOI and can be cited immediately.

Editor-in-Chief:

Prahladh Harsha

Select All

Export Citations Save to Binder

research-article

Open Access

JUST ACCEPTED

Robustness for Space-Bounded Statistical Zero Knowledge

https://doi.org/10.1145/3708508

We show that the space-bounded Statistical Zero Knowledge classes \({{{\sf SZK}_{\sf L}}} \) and \({{{\sf {NISZK}_{\sf {L}}}}} \) are surprisingly robust, in that the power of the verifier and simulator can be strengthened or weakened without ...

research-article

Free

JUST ACCEPTED

The Chromatic Number of Kneser Hypergraphs via Consensus Division

Ishay Haviv

https://doi.org/10.1145/3708511

We show that the Consensus Division theorem implies lower bounds on the chromatic number of Kneser hypergraphs, offering a novel proof for a result of Alon, Frankl, and Lovász (Trans. Amer. Math. Soc., 1986) and for its generalization by Kříž (Trans. ...

research-article

Free

JUST ACCEPTED

Finding 3-Swap-Optimal Independent Sets and Dominating Sets is Hard

https://doi.org/10.1145/3700642

Local search problems consist of a set of feasible solutions, an objective function, and a neighborhood relation which assigns to each feasible solution a set of neighbors. A solution S is called locally optimal if none of its neighbors has a better ...