Unverified50% confidenceFactExact time
The computational complexity of the prefill stage has a quadratic relationship with sequence length (O(n²)).
1
Sources
50%
Confidence
Long-term
Relevance
10/1/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedFor a mini-batch of size N, sample-pair relation distillation requires computing N(N-1)/2 sample pairs, with a complexity of O(N²)77% similarUnverifiedA domain decomposition strategy can reduce the step complexity from O((L/w)²) to O(L²/(N·w²)), where N is the number of subdomains.77% similarUnverifiedWithout caching, the total time complexity for N steps of generation is roughly on the order of N²·D² + N³·D.74% similarUnverifiedThe computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks73% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/966061API
curl https://kongchang.com/api/v1/knowledge/claims/966061MCP
get_claim(id=966061)