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:
“It is with unfathomable love, pure joy and no regret that we leave this world. Men, do not cry for our fate, but cry for your own.”
—Members of the Order of the Solar T.. New York Times, p. 1 (October l4, 1994)
“Realism holds that things known may continue to exist unaltered when they are not known, or that things may pass in and out of the cognitive relation without prejudice to their reality, or that the existence of a thing is not correlated with or dependent upon the fact that anybody experiences it, perceives it, conceives it, or is in any way aware of it.”
—William Pepperell Montague (1842–1910)
“Trifles light as air
Are to the jealous confirmation strong
As proofs of holy writ.”
—William Shakespeare (1564–1616)