March 4, 2026
Flips, fights & NP frights
Flip Distance of Convex Triangulations and Tree Rotation Is NP-Complete
Decades-old flip puzzle called NP-hard, not NP-complete — comment war ignites
TLDR: Researchers proved finding the shortest flip sequence (and tree rotation distance) is NP-hard, resolving a long-standing puzzle. Comments erupted over NP-hard versus NP-complete wording, with theorists celebrating and practitioners saying they’ll keep using heuristics while the headline police demand precision.
A decades-long math–computer science puzzle about flipping triangle patterns and rotating binary trees just got a verdict: the authors say it’s NP-hard—translation: finding the shortest flip path is brutally tough. Cue the internet chaos. Half the thread is cheering “finally solved!” while the other half is clutching pearls over headlines calling it NP-complete. The pedants swarm, pointing out NP-hard means “at least as hard as the hardest problems,” but not necessarily inside the NP club. The drama is peak nerdcore, with people firing off links to NP-hardness, the Associahedron, and the Tamari lattice like they’re Marvel cameos. Old-school theory fans drop “we’ve waited decades” vibes, referencing classic rotation-distance lore, while engineers shrug: “Cool theorem, my heuristic will still wing it.” Jokes fly: flipping pancakes, rotating Christmas trees, and the instant classic: “Tamari lattice? I barely know her.” The spiciest take: this kills dreams of a fast, guaranteed method to perfectly transform one triangulation into another—at least in general. But optimists counter: there’s still hope for special cases and good approximations. Verdict: big win for theory, with a side of headline correction and meme-fueled theatrics.
Key Points
- •Computing the shortest flip sequence between triangulations of a convex polygon is proved NP-hard.
- •By isomorphism, computing the rotation distance of binary trees is also NP-hard.
- •Flips in convex polygon triangulations correspond to binary tree rotations and relate to the Associahedron and Tamari Lattice.
- •The result resolves a decades-long open complexity question in combinatorics/computational geometry.
- •The proof adapts techniques developed for flip sequences of non-crossing spanning trees from prior SODA25 and SoCG26 works.