Unverified50% confidenceFactExact time
对于n个物品，幂集的规模是2^n，当n=100时组合数量超过10^30，暴力枚举法不实用
1
Sources
50%
Confidence
Long-term
Relevance
7/7/2026
First Seen
Sources
Greedy Algorithms and the Knapsack Problem: Core Notes from MIT 6.0002 Lecture 1
bilibiliAI从零开始学7/3/2026
Related Claims
UnverifiedThe number of legal positions in Go is approximately 2×10^170, a combinatorial complexity far exceeding that of chess at 10^47.61% similarUnverifiedWhen two unit vectors are randomly sampled in d-dimensional space, their inner product has an expected value of 0 and a standard deviation of approximately 1/√d; when d=1024, the standard deviation is approximately 0.031.57% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/146930API
curl https://kongchang.com/api/v1/knowledge/claims/146930MCP
get_claim(id=146930)