Skip to main content

New answers tagged

1 vote

Harder version of the k-partition problem

Short answer: It doesn't look like it. For your first example, hardness results for higher levels of the polynomial hierarchy, this problem is in NP for all $k$ (since a solution can be verified in ...
Highheath's user avatar
  • 1,095

Top 50 recent answers are included