Future-Proof Your Career: AI Manager Masterclass
Learn AI, Data Science & Business — Earn Certificates That Get You Hired
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
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.
Syllabus
Introduction
Real world examples
Types of packing problems
Complexity class etr
Examples
Why
Key Concepts
Coding
Hardness
Taught by
IEEE FOCS: Foundations of Computer Science