Parameterized complexity of PCA

dc.contributor.author	Fomin, Fedor
dc.contributor.author	Golovach, Petr
dc.contributor.author	Simonov, Kirill
dc.date.accessioned	2021-07-02T08:04:15Z
dc.date.available	2021-07-02T08:04:15Z
dc.date.created	2020-09-23T12:42:29Z
dc.date.issued	2020
dc.Published	Leibniz International Proceedings in Informatics. 2020, 162:1 1-5.
dc.identifier.issn	1868-8969
dc.identifier.uri	https://hdl.handle.net/11250/2763031
dc.description.abstract	We discuss some recent progress in the study of Principal Component Analysis (PCA) from the perspective of Parameterized Complexity.	en_US
dc.language.iso	eng	en_US
dc.publisher	Dagstuhl publishing	en_US
dc.rights	Navngivelse 4.0 Internasjonal	*
dc.rights.uri	http://creativecommons.org/licenses/by/4.0/deed.no	*
dc.title	Parameterized complexity of PCA	en_US
dc.type	Journal article	en_US
dc.type	Peer reviewed	en_US
dc.description.version	publishedVersion	en_US
dc.rights.holder	Copyright 2020 The Authors	en_US
cristin.ispublished	true
cristin.fulltext	original
cristin.qualitycode	1
dc.identifier.doi	10.4230/LIPIcs.SWAT.2020.1
dc.identifier.cristin	1832504
dc.source.journal	Leibniz International Proceedings in Informatics	en_US
dc.source.40	162:1
dc.source.pagenumber	1-5	en_US
dc.relation.project	Norges forskningsråd: 263317	en_US
dc.identifier.citation	Leibniz International Proceedings in Informatics. 2020, 1, 1-5	en_US
dc.source.volume	1	en_US

Except where otherwise noted, this item's license is described as Navngivelse 4.0 Internasjonal