On the polynomiality of finding K DMDGP re-orders
Résumé
In [6], the complexity of finding K DMDGP reorders was stated to be NP-complete by inclusion, which fails to provide a complete picture. In this paper we show that this problem is indeed NP-complete for K = 1, but it is in P for each fixed K ≥ 2.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...