A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs.

Tomoyuki Yamakami

Published in: COCOA (1) (2010)

Keyphrases

constraint satisfaction problems
search space
real valued
boolean functions
bounded degree
database
information retrieval
special case
knowledge representation
constraint satisfaction
inductive logic programming
constraint networks
non binary