Common Permutation Problem
| dc.creator | Dvorský, Marián | |
| dc.date | 2008-03-29 | |
| dc.date.accessioned | 2026-07-07T09:29:19Z | |
| dc.date.available | 2026-07-07T09:29:19Z | |
| dc.description | In this paper we show that the following problem is NP-complete: Given an alphabet $Σ$ and two strings over $Σ$, the question is whether there exists a permutation of $Σ$ which is a subsequence of both of the given strings. | |
| dc.identifier | https://arxiv.org/abs/0803.4261 | |
| dc.identifier | http://arxiv.org/abs/0803.4261 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/157739 | |
| dc.subject | Computational Complexity | |
| dc.title | Common Permutation Problem | |
| dc.type | text |