A Note on Avoid vs MCSP
Computational Complexity
2025-12-29 v1
Abstract
A recent result of Ghentiyala, Li, and Stephens-Davidowitz (ECCC TR 25-210) shows that any language reducible to the Range Avoidance Problem via deterministic or randomized Turing reductions is contained in AM coAM. In this note, we present a different potential avenue for obtaining the same result via the Minimal Circuit Size Problem.
Cite
@article{arxiv.2512.21764,
title = {A Note on Avoid vs MCSP},
author = {Edward A. Hirsch and Ilya Volkovich},
journal= {arXiv preprint arXiv:2512.21764},
year = {2025}
}