Unverified50% confidenceFactExact time
The computational complexity of Transformers is proportional to the square of the sequence length (O(n²)).
1
Sources
50%
Confidence
Long-term
Relevance
9/9/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedCausal 1D convolution restricts the convolution to access only the current and previous inputs through left-side zero-padding, with a computational complexity of O(N×k), where k is a fixed kernel size, resulting in overall linear complexity.63% similarUnverified二维数组访问任意位置的时间复杂度为O(1)61% similarUnverified球面亏格为0，环面亏格为1，亏格是衡量曲面复杂程度的拓扑不变量57% similarUnverified一维情况下Wasserstein距离有闭式解，只需排序即可，复杂度为O(n log n)57% similarUnverifiedpoly核计算(γ⟨x,z⟩+r)^d，其中d是degree参数，随着degree增大计算量急剧膨胀56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/880732API
curl https://kongchang.com/api/v1/knowledge/claims/880732MCP
get_claim(id=880732)