Skip to main navigation
Skip to search
Skip to main content
Utrecht University Home
Help & FAQ
Home
Research output
Search by expertise, name or affiliation
Framework for existsR-Completeness of Two-Dimensional Packing Problems
Mikkel Abrahamsen,
T. Miltzow
, Nadja Seiferth
Sub Geometric Computing
Geometric Computing
Research output
:
Working paper
›
Preprint
›
Academic
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Framework for existsR-Completeness of Two-Dimensional Packing Problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Hyperbolic Curve
100%
Two-dimensional Packing Problem
100%
Line Segments
50%
Convex Polygon
50%
Disjoint
25%
Convex Objects
25%
Simple Polygon
25%
Packing Problem
25%
Real Solutions
25%
Multivariate Polynomials
25%
Rigid Motion
25%
Integer Coefficients
25%
Polynomial-time Reduction
25%
Polynomial Inequalities
25%
System of Polynomial Equations
25%
Real Roots
25%
Mathematics
Packing Problem
100%
Polygon
50%
Line Segment
50%
Polynomial
25%
Simple Polygon
25%
Polynomial Equation
25%
Rigid Motion
25%
Integer Coefficient
25%
Real Root
25%
Polynomial Time
25%
Computer Science
Packing Problem
100%
Convex Polygon
50%
Rigid Motion
25%
Polynomial Time
25%
Integer Coefficient
25%
Polynomial Equation
25%