Old Web
English
Sign In
Acemap
>
Paper
>
Fully Polynomial-Time Approximation Scheme for a Problem of Finding a Subsequence.
Fully Polynomial-Time Approximation Scheme for a Problem of Finding a Subsequence.
2016
Alexander V. Kel’manov
S. A. Khamidullin
Semyon Romanchenko
Keywords:
Longest alternating subsequence
Discrete mathematics
Longest common subsequence problem
Polynomial-time approximation scheme
Longest increasing subsequence
Subsequence
Mathematics
Combinatorics
Correction
Source
Cite
Save
Machine Reading By IdeaReader
7
References
1
Citations
NaN
KQI
[]