NP Complete Problems

  • Given N accounts/persons who have non zero amounts,
  • find the M = max number of sets where each set s has sum(s)==0.
  • Each of these sets must be min_set. In other words, min_set CANNOT be divided to setA and setB where sum(setA) == sum(setB)==0.

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store