Unverified60% confidenceFactExact time
A domain decomposition strategy can reduce the step complexity from O((L/w)²) to O(L²/(N·w²)), where N is the number of subdomains.
2
Sources
60%
Confidence
Long-term
Relevance
8/4/2026
First Seen
Sources
分解子域行走：加速蒙特卡洛PDE求解的免网格新方法
Related Claims
UnverifiedThe importance sampling optimization idea can compress the actual algorithmic complexity from O(N) to O(k), where k is much smaller than N.78% similarUnverifiedThe computational complexity of the prefill stage has a quadratic relationship with sequence length (O(n²)).77% similarVerifiedThe Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).76% similarUnverifiedNeural ODEs compute gradients in reverse using the adjoint method, eliminating the need to store intermediate activations and reducing memory complexity from O(number of layers) to O(1).74% similarUnverified直接在SO(3)上做卷积的朴素复杂度为O(B^6)，通过快速球面傅里叶变换（基于Driscoll-Healy或McEwen-Wiaux采样定理）可降低至O(B^5)甚至更低74% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/683536API
curl https://kongchang.com/api/v1/knowledge/claims/683536MCP
get_claim(id=683536)