Sciweavers

JAC
2008
14 years 28 days ago
Study of the NP-completeness of the compact table problem
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 probl...
Jean-Christophe Dubacq, Jean-Yves Moyen