Unverified50% confidenceFactExact time
Without caching, the total time complexity for N steps of generation is roughly on the order of N²·D² + N³·D.
1
Sources
50%
Confidence
Long-term
Relevance
9/15/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).71% similarUnverifiedNTT (Number Theoretic Transform) can reduce the complexity of polynomial multiplication from O(n²) to O(n log n).69% similarUnverifiedFor a mini-batch of size N, sample-pair relation distillation requires computing N(N-1)/2 sample pairs, with a complexity of O(N²)69% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/923483API
curl https://kongchang.com/api/v1/knowledge/claims/923483MCP
get_claim(id=923483)