Skip to content
Vinony
Sections
Maps
Timeline
Graph
Cosmos
Life
Culture
Innovation
People
Climate
Trends
Art
Browse
Search
Search Vinony…
⌘
K
Sign in
Category
Strongly NP-complete problems
page 1
bin packing problem
operations research problem of packing items into the fewest bins
strong NP-completeness
property of computational problems that is a special case of NP-completeness
Strongly NP-complete problems — category · Vinony