Pages that link to "Item:Q2810271"
From MaRDI portal
The following pages link to Approximately counting \(H\)-colorings is \(\#\)BIS-hard (Q2810271):
Displaying 14 items.
- Approximately counting locally-optimal structures (Q295655) (← links)
- The complexity of counting colourings and independent sets in sparse graphs and hypergraphs (Q1590082) (← links)
- Counting and sampling \(H\)-colourings (Q1887143) (← links)
- Faster exponential-time algorithms for approximately counting independent sets (Q2235762) (← links)
- A fixed-parameter perspective on \#BIS (Q2272593) (← links)
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models (Q4969061) (← links)
- Counting Constraint Satisfaction Problems. (Q4993601) (← links)
- Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 (Q5013574) (← links)
- (Q5089204) (← links)
- (Q5092422) (← links)
- (Q5092423) (← links)
- (Q5159424) (← links)
- The Complexity of Counting Surjective Homomorphisms and Compactions (Q5232140) (← links)
- Completeness Results for Counting Problems with Easy Decision (Q5283355) (← links)