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 masterpiece is ... something said once and for all, stated, finished, so that it’s there complete in the mind, if only at the back.”
—Virginia Woolf (1882–1941)
“The problems of victory are more agreeable than the problems of defeat, but they are no less difficult.”
—Winston Churchill (1874–1965)