An approximation trichotomy for Boolean #CSP (2010)
Attributed to:
The Complexity of Counting in Constraint Satisfaction Problems
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1016/j.jcss.2009.08.003
Publication URI: http://dx.doi.org/10.1016/j.jcss.2009.08.003
Type: Journal Article/Review
Parent Publication: Journal of Computer and System Sciences
Issue: 3-4