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:
“To throw obstacles in the way of a complete education is like putting out the eyes; to deny the rights of property is like cutting off the hands. To refuse political equality is like robbing the ostracized of all self-respect, of credit in the market place, of recompense in the world of work, of a voice in choosing those who make and administer the law, a choice in the jury before whom they are tried, and in the judge who decides their punishment.”
—Elizabeth Cady Stanton (1815–1902)
“If we fail to meet our problems here, no one else in the world will do so. If we fail, the heart goes out of progressives throughout the world.”
—Eleanor Roosevelt (1884–1962)