The computational complexity of the elimination problem in generalized sports competitions
From MaRDI portal
(Redirected from Publication:2386202)
Recommendations
Cites work
- A new property and a faster algorithm for baseball elimination
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- scientific article; zbMATH DE number 1418355 (Why is no real title available?)
- scientific article; zbMATH DE number 3366749 (Why is no real title available?)
- Possible Winners in Partially Completed Tournaments
- The new FIFA rules are hard: Complexity aspects of sports competitions.
- The structure and complexity of sports elimination numbers
Cited in
(12)- A connection between sports and matroids: how many teams can we beat?
- Fixing balanced knockout and double elimination tournaments
- Determining the results of tournament games using complete graphs generation
- A new property and a faster algorithm for baseball elimination
- Soccer is Harder Than Football
- An effective system of sports competition management
- This house proves that debating is harder than soccer
- The new FIFA rules are hard: Complexity aspects of sports competitions.
- The structure and complexity of sports elimination numbers
- Tournament schedules and incentives in a double round‐robin tournament with four teams
- Refining the complexity of the sports elimination problem
- On the complexity of bribery and manipulation in tournaments with uncertain information
This page was built for publication: The computational complexity of the elimination problem in generalized sports competitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386202)