非确定性计算的不对称性与复杂性
Asymmetry and Complexity of Nondeterministic Computations
AI总结:
该研究探讨非确定性计算中SoI的有效性,证明其在nKt的随机扩展上平均成立,最坏情况有效性将推出复杂性分离,还建立了SoI、元复杂性与显式构造的等价框架,推进了元复杂性下界研究。
摘要:
信息对称性(SoI)[ZL70]是经典柯尔莫哥洛夫复杂性的基础定理,其在时间有界计算中的状态与复杂性理论和密码学的核心开放问题密切相关。近期研究[HMO26]表明,SoI在rKt复杂性(即随机计算场景)中不成立;相比之下,柯尔莫哥洛夫复杂性的许多基本性质在非确定性场景中仍成立[HLO26],这提示SoI可能为探索计算中随机性与非确定性的相对能力提供富有成效的结构原理。我们的结果揭示,SoI在非确定性计算(即nKt复杂性)中的有效性是一个与多个前沿领域相关的微妙问题:我们证明SoI在nKt的随机扩展上平均成立,而其最坏情况有效性将意味着突破性的复杂性分离;尽管用于证明不对称性的标准密码学论证无法扩展到非确定性场景,但我们提供了非确定性计算中信息仍保持不对称的证据;此外,我们证明SoI将意味着指数时间类坍缩到多项式层次的低层。随后,我们基于[Hir22b, GK22, KK26, HMO26]的工作,开发了连接非确定性场景中信息对称性、元复杂性与显式构造的通用框架,更准确地说,我们证明这三个概念的适当表述在数量上等价;我们将该对应关系的不同方面应用于推进复杂性下界和非确定性计算中SoI不成立的研究,这些结果是无条件的,且提供了元复杂性中已知的最强下界之一。
英文摘要:
Symmetry of Information (SoI) [ZL70] is a fundamental theorem of classical Kolmogorov complexity whose status for time-bounded computation is closely related to central open problems in complexity theory and cryptography. In a recent development, [HMO26] showed that SoI fails for $rKt$ complexity, namely in the setting of randomized computation. By contrast, many basic properties of Kolmogorov complexity are known to remain valid in the presence of nondeterminism [HLO26], suggesting that SoI may provide a fruitful structural principle for exploring the relative power of randomness and nondeterminism in computation. Our results reveal that the validity of SoI for nondeterministic computation, namely for $nKt$ complexity, is a subtle question connected to several frontiers. We show that symmetry of information holds on average for randomized extensions of $nKt$, while its worst case validity would imply breakthrough complexity separations. Although the standard cryptographic argument for asymmetry does not extend to the nondeterministic setting, we provide evidence that information remains asymmetric in nondeterministic computations. Among other results, we show that SoI would imply a collapse of exponential time classes to low levels of the polynomial hierarchy. Then, building on the work of [Hir22b, GK22, KK26, HMO26], we develop a general framework connecting symmetry of information, meta-complexity, and explicit constructions in the nondeterministic setting. More precisely, we prove that suitable formulations of these three notions are quantitatively equivalent. We apply different aspects of this correspondence to make progress on complexity lower bounds and on the failure of SoI for nondeterministic computation. These consequences are unconditional and provide some of the strongest known lower bounds in meta-complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。