An LP Algorithm for Counting Eulerian Orientations Through the Lens of Quasi-polymorphism

Jincheng Guan, Shuai Shao, Ke Shi

The weighted Eulerian orientation counting problem ($\#\mathrm{EO}$) plays a key role in the complexity classification program for Holant problems. A recent result established an $…