Unverified50% confidenceFactExact time
The BSP algorithm reduces rendering complexity from O(n²) to O(n log n).
1
Sources
50%
Confidence
Long-term
Relevance
9/9/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedEmbedding models map text to high-dimensional dense vectors (typically 768 to 3072 dimensions), and ANN algorithms (such as HNSW and IVF-PQ) reduce retrieval complexity from O(n) to approximately O(log n).76% similarUnverifiedMyers' bit-parallel algorithm leverages CPU word length to process matrix cells in parallel, reducing the theoretical complexity to O(m×⌈n/w⌉), where w is the machine word length.67% similarUnverifiedTree-sitter reduces the time complexity of incremental parsing from O(n) to approximately O(k), where k is the number of changed characters.67% similarUnverified原始word2vec需要在整个词汇表上计算softmax归一化，计算复杂度为O(V)，负采样将问题转化为二分类以降低计算量65% similarUnverifiedMLS uses a tree-based key agreement structure (TreeKEM), reducing the computational complexity of adding or removing members from a group from O(n) to O(log n).65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/882929API
curl https://kongchang.com/api/v1/knowledge/claims/882929MCP
get_claim(id=882929)