Keep Up With Latest Trending Papers. Computer Science, AI and Machine Learning and more.Subscribe
CC 0
Source arXiv
Data Structures and Algorithms
Computational Complexity
Computational Geometry
Discrete Mathematics
Many Natural Two-Dimensional Packing Problems Are Algorithmically Similar to Finding Real Roots of Polynomials
Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
Authors
Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth
Related Topics
Read the Paper
Read Paper
◐ Recommended Follows
More
◐ Latest Activity
More