On Complexity of Searching a Subset of Vectors with Shortest Average under a Cardinality Restriction | Sciact - Система учета научной деятельности ИМ СО РАН

On Complexity of Searching a Subset of Vectors with Shortest Average under a Cardinality Restriction Научная публикация

Журнал

Communications in Computer and Information Science
ISSN: 1865-0929

Вых. Данные

Год: 2017, Том: 661, Страницы: 51-57 Страниц : 7 DOI: 10.1007/978-3-319-52920-2_5

Ключевые слова

Euclidean norm; NP-hardness; Pseudo-polymonial time; Subset selection; Vectors sum

Авторы

Еремеев Антон Валентинович ^1,2 , Kelmanov A. ^3,4 , Пяткин Артем Валерьевич ^3,4

Организации

1	Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Sciences, Omsk, Russia
2	Omsk State University n.a. F.M. Dostoevsky, Omsk, Russia
3	Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Sciences
4	Novosibirsk State University

Eremeev A.V. , Kelmanov A. , Pyatkin A.V.
On Complexity of Searching a Subset of Vectors with Shortest Average under a Cardinality Restriction
Communications in Computer and Information Science. 2017. V.661. P.51-57. DOI: 10.1007/978-3-319-52920-2_5 Scopus OpenAlex

Scopus:	2-s2.0-85014263432
OpenAlex:	W2588598782

БД	Цитирований
Scopus	2
OpenAlex	3