Unverified50% confidenceFactExact time
Polylogarithmic-space algorithms can usually be parallelized efficiently and are closely related to the complexity class NC.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedFor graphs with small integer edge weights, Dial's Algorithm (a bucket-sort approach) can reduce the complexity to O(m + C), where C is the maximum edge weight.69% similarUnverified倒排乘积量化（IVFPQ）在PQ基础上引入倒排索引结构，通过聚类将向量库分区，将检索复杂度从线性降低至亚线性64% similarVerifiedThe Hungarian algorithm has a time complexity of O(n³) and can find the globally optimal assignment in bipartite graph matching problems.63% similarUnverifiedThe computational complexity of cross-encoders is O(n²); document representations cannot be precomputed and scoring must be done online pair by pair, so cross-encoders are typically only used to rerank the top-k results returned by an initial retrieval stage.63% similarUnverifiedNew functions such as FILTER, SORT, and UNIQUE, combined with dynamic arrays, simplify data operations that previously required complex nesting.62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1012049API
curl https://kongchang.com/api/v1/knowledge/claims/1012049MCP
get_claim(id=1012049)