factual

Uniform random districting is NP-hard

The problem of provably drawing a uniformly random map, where every possible map is equally likely, is NP-hard; complexity theory establishes relative hardness among such problems but cannot prove any individual one is genuinely hard, so the whole edifice could in principle collapse if a fast algorithm were found, though no one expects that.

factualpending

Speaker

Jordan Ellenberg

Evidence Quote

“NP hard kind of refers to this class of problems that are, so to speak, the hardest problems, and we think the case is that they're all hard rather than that they're all easy, but we don't actually know.”

Source

151 | Jordan Ellenberg on the Mathematics of Political Boundaries— Sean Carroll's Mindscape
Created: 6/13/2026, 12:30:48 AM

Your notes

Loading notes...