Complexity of Constraint Satisfaction - Sufficient Conditions For Tractability

Sufficient Conditions For Tractability

Some complexity results prove that some restrictions are polynomial without giving proving that all other possible restrictions of the same kind are NP-hard.

Read more about this topic:  Complexity Of Constraint Satisfaction

Famous quotes containing the words sufficient and/or conditions:

    “It is by a mathematical point only that we are wise, as the sailor or the fugitive slave keeps the polestar in his eye; but that is sufficient guidance for all our life. We may not arrive at our port within a calculable period, but we would preserve the true course.”
    —Henry David Thoreau (1817–1862)

    “Under all conditions well-organized violence seems to him the shortest distance between two points.”
    —Leon Trotsky (1879–1940)