Partition problem

Result of example execution of algorithm on the table P

In computer science, the partition problem (or number partitioning) is the task of deciding whether a given multiset S of positive integers can be partitioned into two subsets S₁ and S₂ such that the sum of the numbers in S₁ equals the sum of the numbers in S₂. Although the partition problem is NP-complete, there is a pseudo-polynomial time dynamic programming solution, and there are heuristics that solve the problem in many instances, either optimally or approximately. For this reason, it has been called "the easiest NP-hard problem".

单词	Partition problem
释义	Partition problem 英语百科 Partition problem In computer science, the partition problem (or number partitioning) is the task of deciding whether a given multiset S of positive integers can be partitioned into two subsets S₁ and S₂ such that the sum of the numbers in S₁ equals the sum of the numbers in S₂. Although the partition problem is NP-complete, there is a pseudo-polynomial time dynamic programming solution, and there are heuristics that solve the problem in many instances, either optimally or approximately. For this reason, it has been called "the easiest NP-hard problem".
随便看	war against poverty Waragi war aim war aims Waramadan waramaug Waramoto Pharmaceuticals Co. Waran war anchorage warand war and civil war exclusion clause warande warander warandice War and Peace war and special loss war and war related expenditure Warangal Warangal Division warangalone Waranga Res. warangkana Warangul Waran pump warant