arXiv (All)
open access
Subexponential-Time Exact-One Hitting Set
Exact-One Hitting Set is one of Karp's original 21 NP-complete problems: given an explicitly listed family of subsets of an $r$-element ground set, decide whether a subset meets every input set in exactly one element. Combining our reduction with the fixed-width exact-counting theorem of OpenAI (202
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
- Selective Inference for CART with Binary Outcomes#1051343
- Efficient trace frequency queries in sparse graphs#1473838
- How Far Can Sharpness and Complexity Jointly Explain Generalization?#1422898
- On subsets of S^n whose (n + 1)-point subsets are contained in open hemispheres#1537414
- Groups, sets, and wholes#768937
Record · ID 1536808
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