NP-Completeness. Decision Problems Given Some Universal Set X, Let R be a subset of X. The decision problem for R is: Given an arbitrary element a of.
