View all Seminars  |  Download ICal for this event

Recent developments on ∃R-completeness of packing and other problems

Series: Theory Seminar

Speaker: Dr. Mikkel Abrahamsen, Assistant Professor, Department of Computer Science, University of Copenhagen,

Date/Time: Oct 22 16:00:00

Location: Microsoft Teams - ON-LINE

Faculty Advisor:

We will give an introduction to the complexity class ∃R, which consists of problems that are polynomial time reducible to deciding whether system of polynomial equations and inequalities with integer coefficients and many unknowns has a real solution. Many classic problems have recently been shown to be ∃R-complete, such as the Art Gallery Problem, the Minimum Convex Cover problem, training neural networks, geometric embeddability of simplicial complexes, and many variants of 2D packing problems. We will outline some of the techniques used in these proofs, in particular for the case of the ∃R-hardness of packing problems.

Microsoft Teams Link: For more details about the seminar please visit the website at

Speaker Bio:

Host Faculty: Dr. Arindam Khan