Login / Signup

Counting and Enumeration Problems with Bounded Treewidth.

Reinhard PichlerStefan RümmeleStefan Woltran
Published in: LPAR (Dakar) (2010)
Keyphrases
  • np complete
  • bounded treewidth
  • highly parallelizable
  • decision problems
  • machine learning
  • programming language
  • conjunctive queries