The complexity of the fixed point property

DOI10.1007/BF00389835MaRDI QIDQ1354627zbMATH OpenOpenAlexFDO

Authors O. Diekmann

Publication date 26 June 1997

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00389835

zbMATH Keywords

NP-completenessfixed point propertyorder-preserving self-map

Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Algorithms for the fixed point property
• The fixed point property for ordered sets
• Fixed point property for finite ordered sets that contain no crowns with 6 or more elements
• Fixed point property and formal concept analysis
• scientific article; zbMATH DE number 93942

Cites work

• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• Coloring Ordered Sets to Avoid Monochromatic Maximal Chains
• Fibres and ordered set coloring
• Two-colouring all two-element maximal antichains

Cited in

(13)

• Forbidden retracts for finite ordered sets of width at most four
• Minimal automorphic superpositions of crowns
• The fixed point property for ordered sets of interval dimension 2
• The fixed point property for ordered sets
• On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
• Embedding ordered sets into distributive lattices
• The Complexity of Zadeh's Pivot Rule
• Algorithms for the fixed point property
• The fixed vertex property for graphs
• The complexity of the fixed clique property
• Isotone relations revisited
• Fixed point property for finite ordered sets that contain no crowns with 6 or more elements
• The complexity of Tarski's fixed point theorem

This page was built for publication: The complexity of the fixed point property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1354627)