1 paper
Liangda Fang, Yaohui Luo, Delong Li +2
The exact cover problem is a classical NP-hard problem with broad applications in the area of AI. Algorithm DXZ is a method to count exact covers representing by zero-suppressed bi…