Unverified50% confidenceFactExact time
对于n个物品，幂集的规模是2^n；当n=100时组合数量超过10^30
1
Sources
50%
Confidence
Long-term
Relevance
7/6/2026
First Seen
Sources
Greedy Algorithms and the Knapsack Problem: Core Notes from MIT 6.0002 Lecture 1
bilibiliAI从零开始学7/3/2026
Cite This Claim
Stable URI
https://kongchang.com/claim/115508API
curl https://kongchang.com/api/v1/knowledge/claims/115508MCP
get_claim(id=115508)