Recent developments on ∃R-completeness of packing and other problems by Mikkel Abrahamsen
Автор: CSAChannel IISc
Загружено: 2021-10-25
Просмотров: 136
Описание:
Speaker : Mikkel Abrahamsen (University of Copenhagen)
Abstract: 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.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
![Как внимание стало настолько эффективным [GQA/MLA/DSA]](https://imager.clipsaver.ru/Y-o545eYjXM/max.jpg)
