Login / Signup

The complexity of approximating conservative counting CSPs.

Xi ChenMartin E. DyerLeslie Ann GoldbergMark JerrumPinyan LuColin McQuillanDavid Richerby
Published in: STACS (2013)
Keyphrases
  • constraint satisfaction problems
  • constraint satisfaction
  • information systems
  • computational complexity
  • artificial intelligence
  • evolutionary algorithm
  • constraint propagation
  • worst case
  • lower complexity