Conceptio › Archive › arXiv (All)
arXiv (All)open access

FPT=PTIME for Homomorphism Problems on Sparse-Incidence and Bounded-Independence Patterns

Lanzinger, Matthias
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
computational-complexitydatabases
computational complexity, databases
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 1036229
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.