Framework for Existential Real-Completeness of Two-Dimensional Packing Problems

Explore a comprehensive framework for $\exists\mathbb R$-completeness of two-dimensional packing problems in this 23-minute IEEE video. Delve into real-world examples, various types of packing problems, and the complexity class ETR. Gain insights into key concepts, coding techniques, and the hardness of these problems. Learn from experts Mikkel Abrahamsen, Tillmann Miltzow, and Nadja Seiferth as they present their research from the University of Copenhagen, Utrecht University, and Freie Universität Berlin.