Stack Exchange
open access
CC BY-SA
Best Upper Bounds on SAT
In another thread, Joe Fitzsimons asked about "the best current lower bounds on 3SAT." I'd like to go the other way: What's the best current upper bounds on 3SAT? In other words, what is the time complexity of the most efficient SAT solver? In particular, is it conceivable to find a sub-exponential (yet super-polynomial) algorithm for SAT?
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
- Transience Bounds for Distributed Algorithms#629689
- Saturation of edge-ordered graphs#1110059
- Spectral bipartiteness in generalized odd graphs of diameter three#999419
- Redundancy rules for MaxSAT#924027
- Redundancy rules for MaxSAT#919798
Record · ID 787575
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