A Dichotomy for Real Weighted Holant Problems

Authors

Keywords

68Q17 Computational difficulty of problems, Holant, #CSP, counting complexity, computational complexity, dichotomy

Journal

COMPUTATIONAL COMPLEXITY

Volume 25, Issue 1, Pages 255-304

Publisher

Springer Nature

Online

2015-11-18

DOI

10.1007/s00037-015-0118-3

References

View 11 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now