Unverified50% confidenceFactExact time
标准多头注意力中每个Token需与序列中所有其他Token计算相关性权重，计算复杂度为O(N²)
1
Sources
50%
Confidence
Long-term
Relevance
7/22/2026
First Seen
Sources
Related Claims
VerifiedThe Hungarian algorithm has a time complexity of O(n³) and can find the globally optimal assignment in bipartite graph matching problems.69% similarUnverified无索引邻接（Index-Free Adjacency）架构使每个节点直接持有指向相邻节点的物理内存指针，查询遍历时间复杂度为O(1)67% similarUnverified自注意力通过将输入序列映射为查询Q、键K、值V三组向量，计算Q与K的点积相似度后经Softmax归一化得到注意力权重，再加权汇聚V向量65% similarVerifiedThe self-attention mechanism maps each token in the input sequence to three vectors—Query, Key, and Value—and computes attention weights by taking the dot product of Query and Key followed by Softmax normalization.63% similarUnverified非原生图数据库需通过全局索引查找相邻节点，时间复杂度随图规模增长为O(log n)甚至O(n)63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/584977API
curl https://kongchang.com/api/v1/knowledge/claims/584977MCP
get_claim(id=584977)