Unverified50% confidenceFactExact time
The complexity of computing the Gram matrix in traditional kernel methods (such as SVM using the RBF kernel) is O(n²) or even O(n³), making it difficult to scale to large-scale data.
1
Sources
50%
Confidence
Long-term
Relevance
10/14/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedWhen generating new tokens using a KV cache, it is necessary to compute the dot product between the query vector and all historical key vectors in the cache, with a complexity of O(N).61% similarVerifiedThe Hungarian algorithm has a time complexity of O(n³) and can find the globally optimal assignment in bipartite graph matching problems.61% similarUnverifiedIn standard multi-head attention, each token needs to compute relevance weights with all other tokens in the sequence, resulting in a computational complexity of O(N²).61% similarUnverifiedGPTQ minimizes quantization error layer by layer through approximate information from the Hessian matrix.60% similarUnverified树形结构如前缀树Trie、R树能以O(log n)复杂度实现按需检索58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1029512API
curl https://kongchang.com/api/v1/knowledge/claims/1029512MCP
get_claim(id=1029512)