On the Complexity of Partial Order Properties

The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove a lower bound of (n2) for properties that are characterized by forbidden substructures of xed size. For the properties being connected, and having exactly k comparable pairs we show that the recognition complexity is ?n 2 ; the complexity of interval orders is exactly ?n

• Type: Conference
• Year: 1992
• Where: WG
• Authors: Stefan Felsner, Dorothea Wagner
• Keywords: Forbidden Substructures, Recognition Complexityof, Theoretical Computer Science, Unknown Ordered Set, WG 1992