### np-complete

#### NP-complete or NP-hard?

Given a list of n positive integers (n even), divide the list into two sublists such that the difference between the sums of the integers in the two sublists is minimized. Would this be a NP-complete problem or a NP-hard problem?

TL;DR - it's np hard. this is the optimization version of the partition problem. the partition problem is deciding if a given list of positive integers can be divided into 2 subsets so that the sums of the subsets are equal. the optimization version asks for the minimized difference (like you asked). the partition problem is np-complete but the optimization is np hard. you can read more on these problems in wiki: https://en.wikipedia.org/wiki/Partition_problem

### Related Links

NP-complete or NP-hard?

Why using linear integer programming (ILP) though it is NP-Complete?

Prove NP-Completeness of generating 2 shortest routes over given edge grouping constraints?

Reduction to Clique prob

Approximation Algorithm between two NP compete problems

Is it possible to find the probability to a solution of NP-complete problems?

Knapsack for each weight having multiple values - Is it possible to solve?

Reduction from Maximum independent set to Dominating set to prove the Dominating set is NP-complete

How I can prove that 2-CNF is not NP-complete?

When NP complete becomes NP hard

Can it be proven no polynomial algorithm exists for an NP-Complete prob.?

Effect of number base when proving NP completeness of numerical problems

How to reduce 3COLOR to 3SAT?

proof NP-complete

Proof that Dominating Set is NP-Complete

Is this an NP problem?