Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete.

Zachary Abel Erik D. Demaine

Published in: CCCG (2011)

Keyphrases

np complete
randomly generated
satisfiability problem
np hard
special case
petri net

edge information
edge detection
data complexity
computational complexity
constraint satisfaction problems
pspace complete

conjunctive queries
weighted graph
query processing
computationally complex
extreme points
np complete problems

conp complete
neural network
bounded treewidth
multiple scales
line drawings
phase transition