<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Constraint satisfaction problem - Page 22 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Constraint_satisfaction_problem_&amp;p=21">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Constraint_satisfaction_problem_&amp;p=23">3.Next</a>
</p>
<p>relations.</p>

<p>An infinite-domain dichotomy conjecture has been formulated for all CSPs of reducts of finitely bounded homogenous structures, stating that the CSP of such a structure is in P if and only if its <a href="page.php?w=Clone_%28algebra%29">polymorphism clone</a> is equationally non-trivial, and NP-hard otherwise. </p>

<p>The complexity of such infinite-domain CSPs as well as of other generalisations (Valued CSPs, Quantified CSPs, Promise CSPs) is still an area of active research.</p>

<p>Every CSP can also be considered as a <a href="page.php?w=conjunctive_query">conjunctive query</a></p><p>
<a accesskey="1" href="page.php?w=Constraint_satisfaction_problem_&amp;p=21">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Constraint_satisfaction_problem_&amp;p=23">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
