Unverified50% confidenceFactExact time
BVH reduces ray-intersection complexity from O(n) to O(log n) and is the core data structure for accelerating ray intersection.
1
Sources
50%
Confidence
Long-term
Relevance
8/31/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedBVH (Bounding Volume Hierarchy) recursively wraps scene geometry with axis-aligned bounding boxes to form a binary tree, reducing ray intersection complexity from O(n) to O(log n).80% similarUnverifiedStandard self-attention has a computational complexity of O(n²); SSA reduces complexity by having each token attend only to the most relevant subset, theoretically compressible to O(n·log n) or even O(n) level.65% similarUnverifiedThe HNSW algorithm reduces ANN retrieval time complexity from O(N) to O(log N) by constructing a multi-layer proximity graph, and performs better in high-recall scenarios.64% similarUnverified滑动窗口注意力将计算复杂度从O(n²)降至O(n×w)，是Mistral模型家族的核心创新之一63% similarVerifiedInformer reduces the self-attention computation complexity from O(n²) to O(n log n) through ProbSparse sparse attention.59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/830094API
curl https://kongchang.com/api/v1/knowledge/claims/830094MCP
get_claim(id=830094)