Fair redistricting is hard (Q2272397)

This paper studies the computational complexity of the problem of partitioning states into voting districts. Criteria to be satisfied by a fair distribution are discussed. It is shown that even for simple definitions of ``fair'' and ``legal'', deciding whether there exists a fair redistricting among legal maps is NP-hard, so that high computational complexity is inherent to the redistricting problem.