Login / Signup
Definability equals recognizability for graphs of bounded treewidth.
Mikolaj Bojanczyk
Michal Pilipczuk
Published in:
CoRR (2016)
Keyphrases
</>
bounded treewidth
np complete
conjunctive queries
highly parallelizable
decision problems
boolean functions
relational learning
np hard
objective function
computational complexity
special case
knowledge representation
bounded degree