Professor David Cohen

  1. 2005
  2. Published
  3. Published

    Supermodular functions and the complexity of MAX CSP

    Cohen, D., Cooper, M., Jeavons, P. & Krokhin, A., 2005, In: Discrete Applied Mathematics. 149, p. 53-72 20 p.

    Research output: Contribution to journalArticlepeer-review

  4. 2004
  5. Published

    Supermodular Functions and the Complexity of MAX CSP

    Cohen, D., Cooper, M., Jeavons, P. & Krokhin, A., 1 Jan 2004.

    Research output: Working paper

  6. Published

    A complete characterization of complexity for Boolean constraint optimization problems

    Cohen, D., Cooper, M. & Jeavons, P., 2004, p. 212-226.

    Research output: Contribution to conferencePaper

  7. Published

    A maximal tractable class of soft constraints

    Cohen, D., Cooper, M., Jeavons, P. & Krokhin, A., 2004, In: Journal of Artificial Intelligence Research. 22, p. 1-22

    Research output: Contribution to journalArticlepeer-review

  8. Published

    Tractable Decision for a Constraint Language Implies Tractable Search

    Cohen, D. A., 2004, In: Constraints. 9, 3, p. 219-229 11 p.

    Research output: Contribution to journalArticlepeer-review

  9. 2003
  10. Published

    A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure

    Cohen, D. A., 2003, p. 807-811.

    Research output: Contribution to conferencePaper

  11. Published

    New Tractable Classes From Old

    Cohen, D., Jeavons, P. & Gault, R., 2003, p. 263-282.

    Research output: Contribution to conferencePaper

  12. Published

    Soft constraints: complexity and multimorphsims

    Cohen, D., Cooper, M., Jeavons, P. & Krokhin, A., 2003, p. 244-258.

    Research output: Contribution to conferencePaper

  13. Published

    Tractability by Approximating Constraint Languages

    Green, M. J. & Cohen, D. A., 2003.

    Research output: Contribution to conferencePaper