Pages that link to "Item:Q1354627"
From MaRDI portal
The following pages link to The complexity of the fixed point property (Q1354627):
Displaying 13 items.
- The fixed vertex property for graphs (Q890011) (← links)
- The complexity of Tarski's fixed point theorem (Q935168) (← links)
- Forbidden retracts for finite ordered sets of width at most four (Q952633) (← links)
- Algorithms for the fixed point property (Q1285782) (← links)
- Isotone relations revisited (Q1772419) (← links)
- The fixed point property for ordered sets (Q1927945) (← links)
- Fixed point property for finite ordered sets that contain no crowns with 6 or more elements (Q2183104) (← links)
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders (Q2322885) (← links)
- The fixed point property for ordered sets of interval dimension 2 (Q2407685) (← links)
- Embedding ordered sets into distributive lattices (Q2520717) (← links)
- The Complexity of Zadeh's Pivot Rule (Q5137866) (← links)
- Minimal automorphic superpositions of crowns (Q6133363) (← links)
- The complexity of the fixed clique property (Q6616237) (← links)