Login / Signup

A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs.

Tomoyuki Yamakami
Published in: Theor. Comput. Sci. (2012)
Keyphrases
  • constraint satisfaction problems
  • search space
  • information retrieval
  • database systems
  • query processing