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:
“A reasonable change of the world can not be instrumented by pure reason.”
—Friedrich Dürrenmatt (1921–1990)
“Did men but consider that the sun, moon, and stars, and every other object of the senses, are only so many sensations in their minds, which have no other existence but barely being perceived, doubtless they would never fall down and worship their own ideas; but rather address their homage to that eternal invisible Mind which produces and sustains all things.”
—George Berkeley (1685–1753)
“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)