Abstract: The complexity is an invariant of log pairs that was shown by Brown-McKernan-Svaldi-Zong to characterize toric varieties. More precisely, they showed that toric Calabi-Yau pairs minimize the complexity among all Calabi-Yau pairs. I will discuss two works that study this invariant further. The first, joint with Fernando Figueroa (Northwestern), identifies all minimizers of the complexity and studies their birational geometry. The second, joint with Jennifer Li (Princeton) and José Yáñez (UCLA) studies other geometric consequences of small complexity and provides a criterion in terms of the complexity for a variety to be cluster type.