Product-structured convolutions over a domain of size N can be computed in O(N^{2ω/3}) ≈ O(N^{1.582}) arithmetic operations, where ω is the matrix multiplication exponent.
Fast deterministic chromatic number under the asymptotic rank conjecture
1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.
1
Pith paper citing it
1
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Faster Convolutions: Yates and Strassen Revisited
Product-structured convolutions over a domain of size N can be computed in O(N^{2ω/3}) ≈ O(N^{1.582}) arithmetic operations, where ω is the matrix multiplication exponent.