Login / Signup
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.
Felix Brandt
Markus Brill
Edith Hemaspaandra
Lane A. Hemaspaandra
Published in:
AAAI (2010)
Keyphrases
</>
single peaked
computationally hard
fixed parameter tractability
computational complexity
worst case
special case
upper bound