Login / Signup
On OBDDs for CNFs of Bounded Treewidth.
Igor Razgon
Published in:
KR (2014)
Keyphrases
</>
bounded treewidth
boolean functions
np complete
recursive least squares
highly parallelizable
ordered binary decision diagrams
cnf formula
polynomial size
decision problems
model checking
fixed parameter tractable
conjunctive queries
membership queries
monadic datalog
database
relational databases
machine learning