Unverified50% confidenceFactExact time
Multiplication of circulant matrices can be completed in O(n log n) time with the help of the fast Fourier transform.
1
Sources
50%
Confidence
Long-term
Relevance
10/14/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedKruskal算法将所有边按权重排序后依次加入不形成环的边，底层依赖并查集，时间复杂度为O(E log E)65% similarUnverifiedIn an Agent loop, the full context must be sent as input each round; the input token count for round N is approximately C + (N-1) × (O + F), growing linearly or super-linearly with the number of rounds.63% similarUnverifiedThe busy beaver function BB(n) is defined as the maximum number of 1s that an n-state, two-symbol Turing machine can write when it finally halts.63% similarUnverified尾调用优化可将本可能占用 O(n) 栈空间的递归转化为 O(1) 的常量空间消耗62% similarUnverifiedBVH（层次包围盒）加速结构可使点到复杂几何表面的最近距离查询在O(log n)时间内完成，n为几何面片数62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1026614API
curl https://kongchang.com/api/v1/knowledge/claims/1026614MCP
get_claim(id=1026614)