On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs.
Jiawei GaoPublished in: IPEC (2019)
Keyphrases
- fine grained
- bounded treewidth
- coarse grained
- np complete
- tractable cases
- decision problems
- highly parallelizable
- access control
- computational complexity
- conjunctive queries
- fixed parameter tractable
- relational learning
- boolean functions
- directed acyclic graph
- space complexity
- information retrieval
- constraint satisfaction
- constraint satisfaction problems
- information extraction
- knowledge representation
- dynamic programming
- data lineage