完全刻画有损催化计算
Fully Characterizing Lossy Catalytic Computation
AI总结:
本文用普通催化空间完全刻画有损催化空间,证明允许 $e$ 个错误等价于增加 $e\log c$ 比特工作记忆,并给出 $LCL[e]=CL$ 改进的复杂性障碍及非确定、随机版本结果。
摘要:
催化机是一种计算模型,其中传统的空间有界机器被增加了一条额外的、显著更大的“催化”带;这条带虽然可用作工作带,但有一个注意事项:它被初始化为任意字符串,并且在计算结束时必须保持该字符串不变。尽管存在这一限制,催化机已被证明具有令人惊讶的额外能力;带有多项式长度催化带的对数空间机器(称为催化对数空间,即 $CL$)能够计算一些被认为不可能由 $L$ 完成的问题。\n该模型的一个基本问题是,使催化带保持在其确切原始配置的催化条件,是否对微小偏差具有鲁棒性。这项研究由 Gupta 等人(2024)发起,他们将有损催化对数空间($LCL[e]$)定义为 $CL$ 的一种变体,其中在重置催化带时允许至多 $e$ 个错误。他们证明,对于任何 $e=O(1)$,都有 $LCL[e]=CL$,这仍然是我们理解的前沿。\n在本文中,我们依据普通催化空间($CSPACE[s,c]$)完全刻画了有损催化空间($LCSPACE[s,c,e]$)。我们证明 $$LCSPACE[s,c,e]=CSPACE[Θ(s+e\log c),Θ(c)]$$ 换言之,在长度为 $c$ 的催化带上允许 $e$ 个错误,在常数伸缩意义下,等价于一台等效的无错催化机拥有额外的 $e\log c$ 比特普通工作记忆。\n作为推论,我们证明对于任意 $e$,$LCL[e]=CL$ 都蕴含 $SPACE[e\log n]\subseteq ZPP$,从而为超越 $LCL[O(1)]=CL$ 的任何改进给出了一道障碍。我们还对非确定性和随机化催化空间证明了等价结果。
英文摘要:
A catalytic machine is a model of computation where a traditional space-bounded machine is augmented with an additional, significantly larger, "catalytic" tape, which, while being available as a work tape, has the caveat of being initialized with an arbitrary string, which must be preserved at the end of the computation. Despite this restriction, catalytic machines have been shown to have surprising additional power; a logspace machine with a polynomial length catalytic tape, known as catalytic logspace ($CL$), can compute problems which are believed to be impossible for $L$. A fundamental question of the model is whether the catalytic condition, of leaving the catalytic tape in its exact original configuration, is robust to minor deviations. This study was initialized by Gupta et al. (2024), who defined lossy catalytic logspace ($LCL[e]$) as a variant of $CL$ where we allow up to $e$ errors when resetting the catalytic tape. They showed that $LCL[e] = CL$ for any $e = O(1)$, which remains the frontier of our understanding. In this work we completely characterize lossy catalytic space ($LCSPACE[s,c,e]$) in terms of ordinary catalytic space ($CSPACE[s,c]$). We show that $$LCSPACE[s,c,e] = CSPACE[Θ(s + e \log c), Θ(c)]$$ In other words, allowing $e$ errors on a catalytic tape of length $c$ is equivalent, up to a constant stretch, to an equivalent errorless catalytic machine with an additional $e \log c$ bits of ordinary working memory. As a consequence, we show that for any $e$, $LCL[e] = CL$ implies $SPACE[e \log n] \subseteq ZPP$, thus giving a barrier to any improvement beyond $LCL[O(1)] = CL$. We also show equivalent results for non-deterministic and randomized catalytic space.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。