Open Research Index

A 2 o(*n*) Time Algorithm for 3-SAT

anthropics

Lean projectlean/anthropics__formal-math__ethAug 6, 2026score 0

A deterministic algorithm solves 3-SAT on *n* variables in time 2 o(*n*) , which refutes the Exponential Time Hypothesis (ETH). The algorithm in fact solves the harder problem #3-SAT, counting the satisfying assignments, in time 2 O(*n* log log *n* / √log *n*) .

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/lean/anthropics__formal-math__eth
curl -X POST /api/v1/records/lean/anthropics__formal-math__eth/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/lean/anthropics__formal-math__eth/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'