Verified65% confidenceFactTime unknown
The average lookup time complexity of a Map (hash table) is O(1).
3
Sources
65%
Confidence
Long-term
Relevance
5/31/2026
First Seen
Sources
Related Entities
Related Claims
Unverified二维数组访问任意位置的时间复杂度为O(1)76% similarUnverifiedQuasi-linear time refers to a time complexity of O(n·polylog(n)), slightly slower than strictly linear O(n), but far better than polynomial time O(n^k) (k>1).66% similarUnverifiedCausal 1D convolution restricts the convolution to access only the current and previous inputs through left-side zero-padding, with a computational complexity of O(N×k), where k is a fixed kernel size, resulting in overall linear complexity.64% similarUnverifiedFor differential heuristics with K landmarks, the total preprocessing time is O(K × (V+E)log V)61% similarUnverifiedEach iteration of the Interior Point method requires solving a large linear system of equations (equivalent to performing a Cholesky decomposition on the KKT system), with complexity typically between O(n²) and O(n³).60% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/15856API
curl https://kongchang.com/api/v1/knowledge/claims/15856MCP
get_claim(id=15856)