Unverified50% confidenceFactExact time
For differential heuristics with K landmarks, the total preprocessing time is O(K × (V+E)log V)
1
Sources
50%
Confidence
Long-term
Relevance
8/10/2026
First Seen
Sources
Related Claims
Partially VerifiedThe mathematical form of KL divergence is D_KL(p||q) = ∑ p(x_i) log(p(x_i)/q(x_i)).68% similarUnverifiedThe Johnson-Lindenstrauss lemma guarantees that for any ε∈(0,1), as long as the target dimension k≥O(log(n)/ε²), there exists a mapping from high dimensions to k dimensions that preserves all pairwise distances within a factor of (1±ε).65% similarVerifiedThe average lookup time complexity of a Map (hash table) is O(1).61% similarUnverified二维数组访问任意位置的时间复杂度为O(1)58% similarUnverified拓扑排序算法（Topological Sort）最早由Kahn于1962年正式描述，其时间复杂度为O(V+E)，V为节点数量、E为连边数量56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/724682API
curl https://kongchang.com/api/v1/knowledge/claims/724682MCP
get_claim(id=724682)