Counting homomorphisms modulo a prime number
From MaRDI portal
Recommendations
Cites work
- A Complexity Dichotomy for Partition Functions with Mixed Signs
- A Complexity Trichotomy for Approximately Counting List H -Colorings
- Approximately counting \(H\)-colorings is \(\#\)BIS-hard
- Counting homomorphisms to trees modulo a prime
- Graph homomorphisms with complex values: a dichotomy theorem (extended abstract)
- scientific article; zbMATH DE number 1545676 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- Large networks and graph limits
- On the complexity of H-coloring
- The complexity of approximating complex-valued Ising and Tutte partition functions
- The complexity of computing the permanent
- The complexity of counting homomorphisms to cactus graphs modulo 2
- The Complexity of Enumeration and Reliability Problems
- The complexity of parity graph homomorphism: an initial investigation
- The complexity of partition functions
Cited in
(5)- Complexity of correspondence \(H\)-colourings
- Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2
- Complexity classification of counting graph homomorphisms modulo a prime number
- Parameterized (Modular) Counting and Cayley Graph Expanders
- On counting (quantum-)graph homomorphisms in finite fields of prime order
This page was built for publication: Counting homomorphisms modulo a prime number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092422)
