Autor:	Vladimir Popov, Anna Gorbenko
Předmět:	Combinatorics Reduction (complexity) Discrete mathematics NP-COMPLETE MULTIPLE OCCURRENCES SHORTEST COMMON SUPERSTRING PROBLEM Applied Mathematics Shortest common superstring SATISFIABILITY PROBLEM NP-complete Boolean satisfiability problem Mathematics
Zdroj:	Scopus-Elsevier Applied Mathematical Sciences
Popis:	In this paper, we consider multiple occurrences shortest common superstring problem. In particular, we consider an approach to solve the problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35d6691501570d5acbce6ee4deea0cc2 http://www.scopus.com/inward/record.url?eid=2-s2.0-84873285989&partnerID=MN8TOARS Zobrazit plný text záznamu