scientific article; zbMATH DE number 7075922
From MaRDI portal
Publication:4967222
zbMath1409.68136MaRDI QIDQ4967222
Publication date: 3 July 2019
Full work available at URL: http://bulletin.eatcs.org/index.php/beatcs/article/view/445/453
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Compactors for parameterized counting problems ⋮ Counting induced subgraphs: an algebraic approach to \(\#\)W[1-hardness] ⋮ Counting Small Induced Subgraphs Satisfying Monotone Properties ⋮ Parameterised counting in logspace ⋮ Parameterized counting of partially injective homomorphisms ⋮ Counting edge-injective homomorphisms and matchings on restricted graph classes ⋮ Counting induced subgraphs: a topological approach to \#W[1-hardness]
This page was built for publication:
