Complete Problems
Decision problems can be ordered according to many-one reducibility and related feasible reductions such as polynomial-time reductions. 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 to characterize complexity classes of decision problems. For example, the Boolean satisfiability problem is complete for the class NP of decision problems under polynomial-time reducibility.
Read more about this topic: Decision Problem
Famous quotes containing the words complete and/or problems:
“The main reason why men and women make different aesthetic judgments is the fact that the latter, generally incapable of abstraction, only admire what meets their complete approval.”
—Franz Grillparzer (1791–1872)
“An interesting play cannot in the nature of things mean anything but a play in which problems of conduct and character of personal importance to the audience are raised and suggestively discussed.”
—George Bernard Shaw (1856–1950)