Cyclic Extensions of Order Varieties

Authors:
Pierre Ille;Paul Ruet
Affiliations:
CNRS -- Institut de Mathématiques de Luminy, Campus de Luminy, Case 907, 13288 Marseille Cedex 9 (France);CNRS -- Institut de Mathématiques de Luminy, Campus de Luminy, Case 907, 13288 Marseille Cedex 9 (France)
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 8
Cited 0

Linear logic

Theoretical Computer Science
A compendium of problems complete for symmetric logarithmic space

Computational Complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Concurrent Constraint Programming and Non-commutative Logic

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Non-commutative logic III: focusing proofs

Information and Computation
Non-commutative logic II: sequent calculus and phase semantics

Mathematical Structures in Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Undirected ST-connectivity in log-space

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.