"NP-hardness and inapproximability of sparse PCA."

Malik Magdon-Ismail (2017)

Details and statistics

DOI: 10.1016/J.IPL.2017.05.008

access: closed

type: Journal Article

metadata version: 2017-07-11

a service of  Schloss Dagstuhl - Leibniz Center for Informatics