NP-hardness is established for membership, rank, and l1-relaxed rank problems over the correlation polytope using Karp reductions.
Gr¨ otschel, L´ aszl´ o Lov´ asz, and Alexander Schrijver.Geometric algorithms and combinatorial optimization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hardness of some optimization problems over correlation polyhedra
NP-hardness is established for membership, rank, and l1-relaxed rank problems over the correlation polytope using Karp reductions.