 |
|
|
|
| HAL : hal-00274004, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| JAC 2008, Uzès : France (2008) |
|
|
|
|
| Study of the NP-completeness of the compact table problem |
|
|
Jean-Christophe Dubacq 1Jean-Yves Moyen 1 |
|
|
| (10/04/2008) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'informatique de Paris-nord (LIPN) |
|
|
|
CNRS : UMR7030 – Université Paris XIII - Paris Nord |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Autre |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00274004, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00274004 | |
| oai:hal.archives-ouvertes.fr:hal-00274004 | |
| Contributeur : Bruno Durand | |
| Soumis le : Jeudi 17 Avril 2008, 00:51:08 | |
| Dernière modification le : Dimanche 4 Mai 2008, 15:04:40 | |
