Exact Partitioning of High-order Models with a Novel Convex Tensor Cone Relaxation

6 Nov 2019Chuyang KeJean Honorio

In this paper we propose the first correct poly-time algorithm for exact partitioning of high-order models (a worst case NP-hard problem). We define a general class of $m$-degree Homogeneous Polynomial Models, which subsumes several examples motivated from prior literature... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.