Pages that link to "Item:Q1043351"
From MaRDI portal
The following pages link to On the complexity of Slater's problems (Q1043351):
Displaying 15 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
- Maximum distance between Slater orders and Copeland orders of tournaments (Q633222) (← links)
- The relative complexity of analytic tableaux and SL-resolution (Q687165) (← links)
- A tournament of order 14 with disjoint Banks and Slater sets (Q968179) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems (Q1333241) (← links)
- A 16-vertex tournament for which Banks set and Slater set are disjoint (Q1382278) (← links)
- A linear ordering problem of sets (Q2173116) (← links)
- An axiomatic characterization of the Slater rule (Q2235101) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- Complexity results for extensions of median orders to different types of remoteness (Q2348767) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Mathematical characterizations and computational complexity of anti-slide puzzles (Q5919108) (← links)
