Login / Signup
Some NP-hard polygon decomposition problems.
Joseph O'Rourke
Kenneth J. Supowit
Published in:
IEEE Trans. Inf. Theory (1983)
Keyphrases
</>
np hard
decision problems
np complete
computationally challenging
machine learning
linear programming
combinatorial optimization
np hardness
search engine
computational complexity
state space
worst case
convex hull