Knapsack ProblemYou are currentlybrowsing as guest. Click here to log in 


Some collections of numbers make it easy. If each number is more than the sum of all the preceeding numbers, then it's easy. Likewise if there are lots and lots of numbers of similar sizes, because then you can get a good guess and fiddle around with it.
But there are cases for which there is no known fast solution.
Complexity Theory is a difficult area of mathematics, and has widespread applications. See also the page on P vs NP.
Last change to this page Full Page history Links to this page 
Edit this page (with sufficient authority) Change password 
Recent changes All pages Search 