The following pages link to The complexity of Kemeny elections (Q817813):
Displayed 4 items.
- Dichotomy for voting systems (Q859982) (← links)
- On complexity of lobbying in multiple referenda (Q2463791) (← links)
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
- Fixed-Parameter Algorithms for Kemeny Scores (Q3511416) (← links)