Unverified50% confidenceFactExact time
TimesFM's patch mechanism reduces computational complexity from O(n²) to O(p²), where p is the number of patches.
1
Sources
50%
Confidence
Long-term
Relevance
9/5/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedA domain decomposition strategy can reduce the step complexity from O((L/w)²) to O(L²/(N·w²)), where N is the number of subdomains.65% similarUnverifiedThe Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).64% similarUnverifiedPerformer（2020）用随机正交特征将核函数分解为低秩形式实现 O(n) 复杂度62% similarUnverifiedNTT (Number Theoretic Transform) can reduce the complexity of polynomial multiplication from O(n²) to O(n log n).61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/860748API
curl https://kongchang.com/api/v1/knowledge/claims/860748MCP
get_claim(id=860748)