Accurate pseudopolynomial-time algorithms for certain NP-hard problems of searching for a vector subsequence (Q2838802)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Accurate pseudopolynomial-time algorithms for certain NP-hard problems of searching for a vector subsequence |
scientific article; zbMATH DE number 6183609
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Accurate pseudopolynomial-time algorithms for certain NP-hard problems of searching for a vector subsequence |
scientific article; zbMATH DE number 6183609 |
Statements
3 July 2013
0 references
searching for a vector subsequence
0 references
NP-hard problems
0 references
accurate pseudopolynomial algorithm
0 references
Accurate pseudopolynomial-time algorithms for certain NP-hard problems of searching for a vector subsequence (English)
0 references
The authors investigate certain NP-hard problems searching for a subsequence or a sequence in an Euclidean vector space. The required subsequence is supposed to include a fixed number of vectors, which are closely posed with respect to the criterion of the minimum of sum of square distances. The choice of vectors is constrained by the condition that the differences of the preceding and subsequent number have upper and lower bounds by some constants.
0 references
