arXiv (All)
open access
Limits and Constants of OpenAI's Claimed ETH Refutation
A recent OpenAI preprint claims a deterministic algorithm that counts the satisfying assignments of a $k$-CNF formula in time $2^{O_k(n\log\log n/\sqrt{\log n})}$, and $2^{O(n/\sqrt{\log n})}$ at bounded clause density, which would refute the Exponential Time Hypothesis. The headline bound is proved
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Estimating the number of zeros of Dedekind zeta-functions#1328342
- Sendov's conjecture holds for every degree $n\ge 10^{200000}$#1034024
- The Multicolour Size--Ramsey Number of an Even Cycle#799680
- Description Complexity Bounds for Analytic Approximations of Lipschitz Functions#1325789
- A closed-form law for the Salikhov-Zeilberger-Zudilin-Bai family, and computational evidence that Bai's point is optimal#1141781
Record · ID 1536347
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive