A. V. Kel'manov, “The $NP$-completeness of some problems of searching for vector subsets”, Trudy Inst. Mat. i Mekh. UrO RAN, 16, no. 3, 2010, 121

Trudy Instituta Matematiki i Mekhaniki UrO RAN

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive
	Impact factor

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Trudy Inst. Mat. i Mekh. UrO RAN:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2010, Volume 16, Number 3, Pages 121–129 (Mi timm582)

This article is cited in 1 scientific paper (total in 1 paper)

The

N P

$NP$ -completeness of some problems of searching for vector subsets

A. V. Kel'manov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Full-text PDF (163 kB) Citations (1)

References:

PDF

HTML

Abstract: We prove the

N P

$NP$ -completeness of discrete optimization problems, to which some important problems appearing in data analysis involving a search for a vector subset are reduced.

Keywords: extremal problem, complexity,

N P

$NP$ -completeness, search for subsets, Euclidean space, data analysis.

Received: 20.03.2010

Bibliographic databases:

Document Type: Article

UDC: 519.2+621.391

Language: Russian

Citation: A. V. Kel'manov, “The

N P

$NP$ -completeness of some problems of searching for vector subsets”, Trudy Inst. Mat. i Mekh. UrO RAN, 16, no. 3, 2010, 121–129

Citation in format AMSBIB

\Bibitem{Kel10}

\by A.~V.~Kel'manov

\paper The $NP$-completeness of some problems of searching for vector subsets

\serial Trudy Inst. Mat. i Mekh. UrO RAN

\yr 2010

\vol 16

\issue 3

\pages 121--129

\mathnet{http://mi.mathnet.ru/timm582}

\elib{https://elibrary.ru/item.asp?id=15173470}

Linking options:

https://www.mathnet.ru/eng/timm582

https://www.mathnet.ru/eng/timm/v16/i3/p121

This publication is cited in the following 1 articles:

A. V. Kel'manov, “On the complexity of some cluster analysis problems”, Comput. Math. Math. Phys., 51:11 (2011), 1983–1988

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Trudy Instituta Matematiki i Mekhaniki UrO RAN

Statistics & downloads:
Abstract page:	359
Full-text PDF :	124
References:	77
First page:	1

Registration to the website

Logotypes