English(EN) Generalized and Unified Equivalences between Hardness and Pseudoentropy

新理论统一计算硬度和随机性

作者 PulseAugur 编辑部 · [1 个来源] · 2026-07-14 04:00

研究人员开发了一种统一的伪熵表征，加强了计算硬度和随机性之间的关系。这种新表征适用于均匀和非均匀计算模型，并涵盖了香农熵和最小熵等各种熵概念。一项关键的技术进展涉及使用权重受限校准和计算不可区分性，与以前的方法相比，这在字母表大小依赖性方面带来了指数级的改进。 AI

影响为理解计算随机性和硬度奠定了理论基础，可能影响未来的算法设计。

排序理由这是一篇发表在arXiv上的研究论文，详细介绍了理论计算机科学概念。[lever_c_demoted from research: ic=1 ai=0.4]

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 0 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 这是一篇发表在arXiv上的研究论文，详细介绍了理论计算机科学概念。[lever_c_demoted from research: ic=1 ai=0.4]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: Standard; On-topic for AI-industry coverage; kept in the public index.
Story freshness: 53 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

arXiv cs.LG TIER_1 English(EN) · Lunjia Hu, Salil Vadhan · 2026-07-14 04:00

硬度和伪熵之间的广义和统一等价性

arXiv:2507.05972v3 Announce Type: replace-cross Abstract: Pseudoentropy characterizations give quantitatively precise formulations of the relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes a…