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.
翻译:Ghentiyala、Li和Stephens-Davidowitz(ECCC TR 25-210)的最新结果表明,任何通过确定性或随机图灵归约可化为范围规避问题的语言均包含于AM $\cap$ coAM中。本文提出一种通过最小电路规模问题获得相同结论的潜在新路径。