Pure Existence Proofs of Polynomial-time Algorithms
Some problems are known to be solvable in polynomial-time, but no concrete algorithm is known for solving them. For example, the Robertson–Seymour theorem guarantees that there is a finite list of forbidden minors that characterizes (for example) the set of graphs that can be embedded on a torus; moreover, Robertson and Seymour showed that there is an O(n3) algorithm for determining whether a graph has a given graph as a minor. This yields a nonconstructive proof that there is a polynomial-time algorithm for determining if a given graph can be embedded on a torus, despite the fact that no concrete algorithm is known for this problem.
Read more about this topic: P (complexity)
Famous quotes containing the words pure, existence and/or proofs:
“Whenever a person strives, by the help of dialectic, to start in pursuit of every reality by a simple process of reason, independent of all sensuous information—never flinching, until by an act of the pure intelligence he has grasped the real nature of good—he arrives at the very end of the intellectual world.”
—Plato (c. 427–347 B.C.)
“We are compelled by the theory of God’s already achieved perfection to make Him a devil as well as a god, because of the existence of evil. The god of love, if omnipotent and omniscient, must be the god of cancer and epilepsy as well.... Whoever admits that anything living is evil must either believe that God is malignantly capable of creating evil, or else believe that God has made many mistakes in His attempts to make a perfect being.”
—George Bernard Shaw (1856–1950)
“I do not think that a Physician should be admitted into the College till he could bring proofs of his having cured, in his own person, at least four incurable distempers.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)