Login / Signup

Faster algorithms for quantitative verification in bounded treewidth graphs.

Krishnendu ChatterjeeRasmus Ibsen-JensenAndreas Pavlogiannis
Published in: Formal Methods Syst. Des. (2021)
Keyphrases
  • bounded treewidth
  • learning algorithm
  • highly parallelizable
  • np complete
  • graph theory
  • decision trees
  • computational complexity
  • logic programs