I'll check it out. Thanks! Edit: I didn't find anything in that particular resource. A similar work mentioning complexity is here: https://desh2608.github.io

I'll check it out. Thanks! Edit: I didn't find anything in that particular resource. A similar work mentioning complexity is here: https://desh2608.github.io/static/report/ohio.pdf https://desh2608.github.io/static/report/ohio.pdf Roughly, it boils down to a constrained search for the best mapping of precincts into districts, which is NP-hard.