Pages that link to "Item:Q5326574"

The following pages link to Counting Matchings of Size k Is $\sharp$ W[1]-Hard (Q5326574):

Displaying 20 items.

• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
• Extending the characteristic polynomial for characterization of C\(_{20}\) fullerene congeners (Q1649082) (← links)
• Randomised enumeration of small witnesses using a decision oracle (Q1725640) (← links)
• Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
• The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721) (← links)
• Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
• Parameterized counting of trees, forests and matroid bases (Q2399367) (← links)
• Parameterized counting matching and packing: a family of hard problems that admit FPTRAS (Q2636502) (← links)
• Some Hard Families of Parameterized Counting Problems (Q2832302) (← links)
• On Counting Parameterized Matching and Packing (Q4632178) (← links)
• (Q5009461) (← links)
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
• (Q5091007) (← links)
• Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)
• Counting independent sets in graphs with bounded bipartite pathwidth (Q6074656) (← links)
• Parameterised counting in logspace (Q6093373) (← links)
• Parameterised and fine-grained subgraph counting, modulo 2 (Q6130316) (← links)
• On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (Q6157971) (← links)
• Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)