T Jiang

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The complexity of near-optimal graph coloring. 3. The trivial reduction from max not-all-equal 3sat works. Remark 3.19 The approximation of max set splitting remains hard even if all subsets in C are of cardinality less than or equal to 3 (see the proof). We follow by deening the problem max-qer. Deenition 3.20 (The problem max-qer: Max Quadratic Equations(More)
  • 1