Pages that link to "Item:Q1590082"

The following pages link to The complexity of counting colourings and independent sets in sparse graphs and hypergraphs (Q1590082):

Displaying 24 items.

• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
• Counting houses of Pareto optimal matchings in the house allocation problem (Q738845) (← links)
• The complexity of weighted Boolean \#CSP with mixed signs (Q837186) (← links)
• Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
• On the complexity of finding and counting solution-free sets of integers (Q1752464) (← links)
• Holographic reduction, interpolation and hardness (Q1926111) (← links)
• Improved mixing condition on the grid for counting and sampling independent sets (Q1955841) (← links)
• Computational complexity of counting problems on 3-regular planar graphs (Q2382289) (← links)
• Factor models on locally tree-like graphs (Q2434914) (← links)
• Improved inapproximability results for counting independent sets in the hard-core model (Q2877770) (← links)
• Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
• Organization mechanism and counting algorithm on vertex-cover solutions (Q3302224) (← links)
• Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model (Q4634031) (← links)
• Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model (Q5009783) (← links)
• A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems (Q5050764) (← links)
• (Q5159424) (← links)
• Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models (Q5366911) (← links)
• Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results (Q5506693) (← links)
• Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs (Q5890038) (← links)
• Faster graph coloring in polynomial space (Q5925619) (← links)
• Counting independent sets in graphs with bounded bipartite pathwidth (Q6074656) (← links)
• Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial (Q6198132) (← links)
• Counting subgraphs in somewhere dense graphs (Q6621747) (← links)