Computing an optimal layout for automatically-placed GUI widgets can be NP-complete, by reduction to a knapsack problem. Our profession benefits greatly from a

Computing an optimal layout for automatically-placed GUI widgets can be NP-complete, by reduction to a knapsack problem. Our profession benefits greatly from a basic knowledge of computational complexity theory.