Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory
From MaRDI portal
Publication:5146921
DOI10.1137/1.9781611975994.133OpenAlexW3001767841MaRDI QIDQ5146921
Publication date: 2 February 2021
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.03850
Related Items (1)
This page was built for publication: Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory