|
NP-completeness of special string editing problems
S. S. Martynov TVP Laboratory, Moscow
Abstract:
We establish the NP-completeness of the string editing problems with respect to a language defined by restrictions on a subwords of its words. The editing operations consists in a replacement of the substrings belonging to a specified block code, by the words of another block code.
Key words:
string editing problems, NP-complete problems, block code.
Received 20.IV.2012
Citation:
S. S. Martynov, “NP-completeness of special string editing problems”, Mat. Vopr. Kriptogr., 4:4 (2013), 77–93
Linking options:
https://www.mathnet.ru/eng/mvk103https://doi.org/10.4213/mvk103 https://www.mathnet.ru/eng/mvk/v4/i4/p77
|
Statistics & downloads: |
Abstract page: | 288 | Full-text PDF : | 191 | References: | 43 | First page: | 1 |
|