Unverified50% confidenceSolutionExact time
Top-K剪枝策略本质上是一种基于优先队列（最小堆）的分支限界算法
1
Sources
50%
Confidence
Long-term
Relevance
9/10/2026
First Seen
Sources
Related Entities
Cite This Claim
Stable URI
https://kongchang.com/claim/887404API
curl https://kongchang.com/api/v1/knowledge/claims/887404MCP
get_claim(id=887404)