PulseAugur
中
实时 15:45:01
English(EN) Anthropic and OpenAI both say they refuted the Exponential Time Hypothesis with a 2^o(n) algorithm for 3-SAT, found on the same day. Before anyone rewrites thei

Anthropic 和 OpenAI 声称用新的 3-SAT 算法反驳了 ETH

Anthropic 和 OpenAI 都声称用一种新的 3-SAT 问题算法反驳了指数时间假设 (ETH)。该算法据称实现了 2^o(n) 的运行时间。然而,Anthropic 的具体界限要求 n 大于 10^10000 才能优于暴力破解,并且该证明是由 AI 生成和审查的,没有人为验证该陈述是否准确反映了 ETH。 AI

影响 如果得到验证,这一发展可能对理论计算机科学和算法设计产生重大影响。

排序理由 该集群讨论了使用 AI 生成的证明声称反驳理论计算机科学假设,这属于研究范畴。[lever_c_demoted from research: ic=1 ai=1.0]

在 Mastodon — mastodon.social 阅读 →

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

Anthropic 和 OpenAI 声称用新的 3-SAT 算法反驳了 ETH

本文如何被排名

Signal score
11 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
该集群讨论了使用 AI 生成的证明声称反驳理论计算机科学假设,这属于研究范畴。[lever_c_demoted from research: ic=1 ai=1.0]
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
High
Clearly on-topic for AI-industry coverage.
Story freshness
Breaking (< 6h)
Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

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

报道来源 [1]

  1. Mastodon — mastodon.social TIER_1 English(EN) · takschdube ·

    Anthropic and OpenAI both say they refuted the Exponential Time Hypothesis with a 2^o(n) algorithm for 3-SAT, found on the same day. Before anyone rewrites thei

    Anthropic and OpenAI both say they refuted the Exponential Time Hypothesis with a 2^o(n) algorithm for 3-SAT, found on the same day. Before anyone rewrites their SAT solver: Anthropic's own bound at five clauses per variable doesn't beat brute force until n > 10^10000. The Lean p…