Parameterised holant problems
From MaRDI portal
Cites work
- A complete dichotomy rises from the capture of vanishing signatures
- A full dichotomy for \(\mathrm{Holant}^c\), inspired by quantum computation
- Anti-factor is FPT parameterized by treewidth and list size (but counting is hard)
- Can you beat treewidth?
- Complexity classification of the eight-vertex model
- Complexity classification of the six-vertex model
- Count on CFI graphs for \#P-hardness
- Counting Answers to Existential Questions
- Counting Homomorphic Cycles in Degenerate Graphs
- Counting matchings of size \(k\) is \#W[1]-hard
- Counting restricted homomorphisms via Möbius inversion over matroid lattices
- Counting small induced subgraphs satisfying monotone properties
- Counting small induced subgraphs with hereditary properties
- Counting Subgraphs in Degenerate Graphs
- Degrees and gaps: tight complexity results of general factor problems parameterized by treewidth and cutwidth
- Exact and approximate pattern counting in degenerate graphs: new algorithms, hardness results, and complexity dichotomies
- Graph factors and factorization: 1985--2003: a survey
- Holant problems and counting CSP
- Holographic Algorithms
- Holographic algorithms: from art to science
- Homomorphisms are a good basis for counting small subgraphs
- scientific article; zbMATH DE number 512804 (Why is no real title available?)
- scientific article; zbMATH DE number 7204481 (Why is no real title available?)
- Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths
- New bounds for matrix multiplication: from alpha to omega
- On the inherent intractability of certain coding problems (Corresp.)
- On the Structure of Polynomial Time Reducibility
- Parameterized (Modular) Counting and Cayley Graph Expanders
- Parameterized algorithms
- Parameterized complexity of constraint satisfaction problems
- Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting
- Parameterized Counting and Cayley Graph Expanders
- Parameterized counting problems
- Parameterized intractability of even set and shortest vector problem from Gap-ETH
- Parameterizing the permanent: genus, apices, minors, evaluation \(\operatorname{mod} 2^k\)
- PP is as Hard as the Polynomial-Time Hierarchy
- Strong computational lower bounds via parameterized complexity
- The complexity of complex weighted Boolean \#CSP
- The complexity of computing the permanent
- The complexity of counting edge colorings for simple graphs
- The complexity of counting homomorphisms seen from the other side
- The Complexity of Enumeration and Reliability Problems
- The complexity of pattern counting in directed graphs, parameterised by the outdegree
- The complexity of symmetric Boolean parity Holant problems
- The Parameterized Complexity of Counting Problems
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- Tight lower bounds for certain parameterized NP-hard problems
- Valiant's holant theorem and matchgate tensors
- Weighted counting of \(k\)-matchings is \#W[1]-hard
This page was built for publication: Parameterised holant problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346434)
