Counting 2-Factors of 4-Regular Bipartite Graphs is $\#P$-Complete
- 11 August 2025
- book chapter
- Published by Springer Nature
- p. 94-103
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- The complexity of planar Boolean #CSP with complex weightsJournal of Computer and System Sciences, 2020
- Complexity classification of the six-vertex modelInformation and Computation, 2018
- A Dichotomy for Real Weighted Holant Problemscomputational complexity, 2015
- A Dichotomy Theorem for Polynomial EvaluationLecture Notes in Computer Science, 2009
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubesTheoretical Computer Science, 2003
- On the number of Eulerian orientations of a graphAlgorithmica, 1996
- Approximating the permanent of graphs with large factorsTheoretical Computer Science, 1992
- The complexity of computing the permanentTheoretical Computer Science, 1979
- The statistics of dimers on a latticePhysica, 1961
- The Structure and Entropy of Ice and of Other Crystals with Some Randomness of Atomic ArrangementJournal of the American Chemical Society, 1935