-->
登录/注册
首页
DayDayUp
ELSE
运维
当前位置:
首页
>
题库
Consider a Knapsack problem with $$n$$ items. If no items have a
Luz
5年前
(2021-05-10)
题库
917
Consider a Knapsack problem with $$n$$ items. If no items have a size larger than $$n^3$$, then it is no longer NP-hard. ~@[](2)答案:TRUE
搜索
关键词之间使用空格分隔