Study of the NP-completeness of the compact table problem
Abstract
The problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). This problem is shown to be NP-complete in the general case, and some specific restrictions are studied.
Domains
Other [cs.OH]
Origin : Explicit agreement for this submission