Autor:	Gorbenko, A., Vladimir Popov
Předmět:	NP-COMPLETE MULTIPLE OCCURRENCES SHORTEST COMMON SUPERSTRING PROBLEM SATISFIABILITY PROBLEM
Zdroj:	Scopus-Elsevier Applied Mathematical Sciences
Popis:	In this paper, we consider multiple occurrences shortest common superstring problem. In particular, we show that the problem is NPcomplete.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e978434247e56b43a2d479bbe5343b59 http://www.scopus.com/inward/record.url?eid=2-s2.0-84869766224&partnerID=MN8TOARS Zobrazit plný text záznamu