arXiv (All)
open access
Short Resolution Refutations for CNFs with Bounded Weighted Incidence Treewidth
It is an open problem in proof complexity whether every unsatisfiable CNF formula has an FPT-sized resolution refutation parameterized by incidence treewidth. In this paper, we establish several upper bounds on resolution refutation length related to this problem. Consider an unsatisfiable CNF for
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
- Sharp Edge-Edit Bounds at Every Level for Leaky Positive Semidefinite Forcing#1037487
- Minimum Sum Vertex Cover via Minimum Vertex Cover#1063328
- Certifiable Near-Optimality: A Simple Framework for Unifying Search and Refutation for (Semi)random CSPs#1142968
- Exact Conditional Confidence Intervals for Cramér's V: Near-Nominal and Tight Where the Guaranteed Interval Is Wide and the Software Interval Does Not Cover#1062065
- Refutation of the formal system proposed for proof by the founders of the Evolution 2.0 award.#715639
Record · ID 1157395
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