Pages that link to "Item:Q4993599"
From MaRDI portal
The following pages link to On the Complexity of Holant Problems (Q4993599):
Displaying 5 items.
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (Q3637246) (← links)
- (Q5111359) (← links)
- The HOM Problem is EXPTIME-Complete (Q5892435) (← links)
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard) (Q6670813) (← links)