Login / Signup

Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules.

Krzysztof SornatVirginia Vassilevska WilliamsYinzhan Xu
Published in: CoRR (2022)
Keyphrases
  • computationally hard
  • worst case
  • orders of magnitude
  • upper bound
  • data structure
  • computational complexity
  • learning algorithm