The following pages link to (Q4012214):
Displaying 7 items.
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- No more ``Partial'' and ``Full Looking Ahead'' (Q1128494) (← links)
- Using constraint metaknowledge to reduce arc consistency computation (Q1277773) (← links)
- Solving linear, min and max constraint systems using CLP based on relational interval arithmetic (Q1391939) (← links)
- The complexity of constraint satisfaction revisited (Q2675271) (← links)
- Combining qualitative and quantitative constraints in temporal reasoning (Q2676582) (← links)
- Tradeoffs in the Complexity of Backdoor Detection (Q3523063) (← links)
