Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARS
- 1 December 2020
- journal article
- research article
- Published by Elsevier in Information and Computation
- Vol. 275
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China
- Natural Science Foundation of Jilin Province
- National Science Foundation
- Fundamental Research Funds for the Central Universities
This publication has 19 references indexed in Scilit:
- The complexity of weighted and unweighted #CSPJournal of Computer and System Sciences, 2012
- The complexity of weighted Boolean #CSP with mixed signsTheoretical Computer Science, 2009
- The Complexity of Weighted Boolean #CSPSIAM Journal on Computing, 2009
- On the number of Eulerian orientations of a graphAlgorithmica, 1996
- Complexity of Generalized Satisfiability Counting ProblemsInformation and Computation, 1996
- On the evaluation at (3, 3) of the Tutte polynomial of a graphJournal of Combinatorial Theory, Series B, 1988
- Alternating sign matrices and descending plane partitionsJournal of Combinatorial Theory, Series A, 1983
- Calculation of norms of Bethe wave functionsCommunications in Mathematical Physics, 1982
- Residual Entropy of Square IcePhysical Review B, 1967
- The Structure and Entropy of Ice and of Other Crystals with Some Randomness of Atomic ArrangementJournal of the American Chemical Society, 1935