Pages that link to "Item:Q4899251"
From MaRDI portal
The following pages link to Weighted Counting of k-Matchings Is #W[1]-Hard (Q4899251):
Displaying 4 items.
- Compactors for parameterized counting problems (Q826317) (← links)
- The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- Counting problems in parameterized complexity (Q5009461) (← links)