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:
“But all its chief delight was still
On Roses thus its self to fill:
And its pure virgin Limbs to fold
In whitest sheets of Lillies cold.
Had it liv’d long it would have been
Lillies without, Roses within.”
—Andrew Marvell (1621–1678)
“The settlement of America had its origins in the unsettlement of Europe. America came into existence when the European was already so distant from the ancient ideas and ways of his birthplace that the whole span of the Atlantic did not widen the gulf.”
—Lewis Mumford (1895–1990)
“Trifles light as air
Are to the jealous confirmation strong
As proofs of holy writ.”
—William Shakespeare (1564–1616)