arXiv CS
open access
FPT=PTIME for Homomorphism Problems on Sparse-Incidence and Bounded-Independence Patterns
Assuming the Exponential Time Hypothesis (ETH), fixed-parameter tractability and polynomial-time solvability coincide for homomorphism problems specified by classes of pattern hypergraphs of bounded incidence degeneracy or bounded primal independence number. In both cases, tractability is characteri
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
- FPT=PTIME for Homomorphism Problems on Sparse-Incidence and Bounded-Independence Patterns#1036229
- AN EXTENDED ATMS FOR DECOMPOSABLE PROBLEMS#933456
- A point-free theory of quantitative homogenization#635957
- A point-free theory of quantitative homogenization#633608
- Homogenization effects on non-local functionals#820457
Record · ID 1006936
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