Login / Signup

The complexity of approximating conservative counting CSPs.

Xi ChenMartin E. DyerLeslie Ann GoldbergMark JerrumPinyan LuColin McQuillanDavid Richerby
Published in: J. Comput. Syst. Sci. (2015)
Keyphrases
  • constraint satisfaction problems
  • search space
  • worst case
  • multiscale
  • computational complexity
  • constraint propagation
  • databases
  • constraint programming
  • memory requirements
  • constraint networks