Cyclic extensions of order varieties
Résumé
We study complexity problems involving three sorts of combinational structures: cyclic orders, order varieties and cycles. It is known that the problem of telling whether a cyclic order is included in some cycle is NP-complete. We show that the same question for order varieties, a special class of cyclic orders, is in L. For this, we relate the entropy relation between partial orders to the forcing relation of graph theory.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...