Assertion: decision problem | /r/HasProperty | reduced to p. complete decision problems
Facets:
Source sentences:
text: A decision problem P is said to be complete for a set of decision problems S if P is a member of S and every problem in S can be reduced to P. Complete decision problems are used in computational complexity theory to characterize complexity classes of decision problems.