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:
“A complete woman is probably not a very admirable creature. She is manipulative, uses other people to get her own way, and works within whatever system she is in.”
—Anita Brookner (b. 1938)
“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)