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 love between man and woman is the greatest and most complete passion the world will ever see, because it is dual, because it is of two opposing kinds.”
—D.H. (David Herbert)
“The man who is forever disturbed about the condition of humanity either has no problems of his own or has refused to face them.”
—Henry Miller (1891–1980)