Treewidth with a Quantifier Alternation Revisited.

Michael Lampis Valia Mitsou

Published in: IPEC (2017)

Keyphrases

bounded treewidth
search space
upper bound
space complexity
boolean functions
tree decompositions
quantifier elimination
discrete random variables
data sets
learning algorithm
artificial intelligence
worst case