arXiv (All)
open access
Lowered crossover points of Anthropic's subexponential 3-SAT algorithm
The October 2026 refutations of the Exponential Time Hypothesis count satisfying assignments in time $2^{o(n)}$, but an asymptotic bound does not say from which input size, the crossover point, they beat the best known algorithms. We make the #3-SAT recursion of Anthropic's algorithm explicit and lo
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
- CAS II: Orbits as Models: Kolmogorov's Structure Function under Symmetry#1381376
- SAT for Dummies#1290621
- Distributional Variants of the Aaronson-Ambainis Conjecture#1129919
- Consensus Time in 3-Majority and 2-Choices Is Determined by the Maximum Initial Opinion Density#1130575
- Irreversibility and Complexity#108327
Record · ID 1534791
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