Cyclic Extensions of Order Varieties | Zendy

Pierre Ille | Zendy; Paul Ruet | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Cyclic Extensions of Order Varieties

Author(s) -

Pierre Ille,

Paul Ruet

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.04.057

Subject(s) - mathematics , order (exchange) , forcing (mathematics) , relation (database) , class (philosophy) , discrete mathematics , pure mathematics , combinatorics , computer science , mathematical analysis , artificial intelligence , finance , database , economics

International audienceWe 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research