The Question of What’s Fair Illuminates the Question of What’s Hard

Theoretical computer scientists deal with complicated ideas. But whenever possible, they’d prefer to work with simpler ones. A 2009 tool known as the regularity lemma gives them a great way to do this. It effectively lets them break a given computational problem or function into simpler pieces. For computational complexity theorists, who study the relative hardness of different problems…

Source