The important insight is that for repetition codes, this results in what's called a planar graph, where edges don't cross each other. "This allows us to exploit the exact, efficient solutions for ...

Refining with colors Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.