Eulerian orientations and Hadamard codes: A novel connection via counting
Open Access
- 28 June 2026
- journal article
- Published by Elsevier in Information and Computation
- Vol. 312
Abstract
No abstract availableAll Related Versions
Funding Information
- National Natural Science Foundation of China
This publication has 12 references indexed in Scilit:
- Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARSInformation and Computation, 2020
- Complexity classification of the six-vertex modelInformation and Computation, 2018
- The complexity of complex weighted Boolean #CSPJournal of Computer and System Sciences, 2014
- 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
- Theory of the Transition in KH2PO4The Journal of Chemical Physics, 1941
- The Structure and Entropy of Ice and of Other Crystals with Some Randomness of Atomic ArrangementJournal of the American Chemical Society, 1935