Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.21764 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909976014880768 |
|---|---|
| author | Hirsch, Edward A. Volkovich, Ilya |
| author_facet | Hirsch, Edward A. Volkovich, Ilya |
| contents | 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 $\cap$ coAM. In this note, we present a different potential avenue for obtaining the same result via the Minimal Circuit Size Problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_21764 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Note on Avoid vs MCSP Hirsch, Edward A. Volkovich, Ilya Computational Complexity 68Q15 F.1.3 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 $\cap$ coAM. In this note, we present a different potential avenue for obtaining the same result via the Minimal Circuit Size Problem. |
| title | A Note on Avoid vs MCSP |
| topic | Computational Complexity 68Q15 F.1.3 |
| url | https://arxiv.org/abs/2512.21764 |