The paper introduces the omega-submodular width, a generalization of submodular width that captures fast matrix multiplication, and proves an algorithm that evaluates any Boolean conjunctive query in time proportional to that width.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fast Matrix Multiplication meets the Submodular Width
The paper introduces the omega-submodular width, a generalization of submodular width that captures fast matrix multiplication, and proves an algorithm that evaluates any Boolean conjunctive query in time proportional to that width.