3 papers
cs.CC2025
P-time Algorithms for Typical #EO Problems
Boning Meng, Juqiu Wang, Mingji Xia
In this article, we study the computational complexity of counting weighted Eulerian orientations, denoted as \#\textsf{EO}. This problem is considered a pivotal scenario in the co…
cs.CC2025
The versus #P dichotomy for #EO
Boning Meng, Juqiu Wang, Mingji Xia
The complexity classification of the Holant problem has remained unresolved for the past fifteen years. Counting complex-weighted Eulerian orientation problems, denoted as #EO, is…
cs.CC2025
From an odd arity signature to a Holant dichotomy
Boning Meng, Juqiu Wang, Mingji Xia +1
\textsf{Holant} is an essential framework in the field of counting complexity. For over fifteen years, researchers have been clarifying the complexity classification for complex-va…