Unverified50% confidenceFactExact time
For 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.
1
Sources
50%
Confidence
Long-term
Relevance
9/22/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedXGBoost's histogram algorithm discretizes continuous features into a fixed number of bins (typically 256), reducing the split-point search complexity from O(n·d) to O(bins).75% similarVerifiedThe Hungarian algorithm has a time complexity of O(n³) and can find the globally optimal assignment in bipartite graph matching problems.70% similarUnverifiedselect 受限于 FD_SETSIZE（通常为1024），poll 采用线性扫描为 O(n) 复杂度67% 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.65% similarUnverifiedBinary search locates an element in a sorted array in only O(log n) comparisons, and the search and insertion operations of a balanced binary search tree also have O(log n) time complexity.64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/942007API
curl https://kongchang.com/api/v1/knowledge/claims/942007MCP
get_claim(id=942007)