A witness-sensitive algorithm detects induced diamonds in Õ(min(n^{2.425}/t^{0.25} + n², n^ω)) time with high probability, improving on the prior O(n^ω log n) bound when t ≥ n^{(3-ω)/3}.
Subcubic Equivalences Between Path, Matrix, and Triangle Problems , volume =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Witness-Sensitive Detection of Induced Diamonds
A witness-sensitive algorithm detects induced diamonds in Õ(min(n^{2.425}/t^{0.25} + n², n^ω)) time with high probability, improving on the prior O(n^ω log n) bound when t ≥ n^{(3-ω)/3}.