arXiv (OAI Expanded)
open access
One Unit Separates Polynomial Time from Undecidability in Term Coding
Term coding provides a common algebraic framework for network coding, index coding and problems in extremal combinatorics. We exhibit a decision problem in which lowering an output threshold by just one changes the complexity from polynomial time to undecidability: no algorithm then halts with the c
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
- Improved Lower Bounds on the Capacity of the Binary Deletion Channel via a Learning Approach to Run-Length Inputs#1051305
- On the Parameterized Complexity of $s$-Club Cluster Edge Deletion#793494
- On the Parameterized Complexity of $s$-Club Cluster Edge Deletion#789490
- When LLM Decompilers Recompile More and Preserve Less#972298
- Halting problem undecidability and infinitely nested simulation (V3)#757819
Record · ID 1082942
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