Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
Under an Elsevier user license
open archive
Keywords
Constraint satisfaction problem
#CSP
Bounded degree
AP-reducibility
Constructibility
Symmetrization
#SAT
Holant problem
Signature
Cited by (0)
Copyright © 2011 Elsevier B.V. All rights reserved.