An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. / Cohen, David A.; Creed, Páidí; Jeavons, Peter G.; Živný, Stanislav.

Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011: Proceedings. Springer, 2011. p. 231-242 (Lecture Notes in Computer Science; Vol. 6907).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published

Standard

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. / Cohen, David A.; Creed, Páidí; Jeavons, Peter G.; Živný, Stanislav.

Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011: Proceedings. Springer, 2011. p. 231-242 (Lecture Notes in Computer Science; Vol. 6907).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harvard

Cohen, DA, Creed, P, Jeavons, PG & Živný, S 2011, An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. in Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011: Proceedings. Lecture Notes in Computer Science, vol. 6907, Springer, pp. 231-242, MFCS, United Kingdom, 20/11/11. https://doi.org/10.1007/978-3-642-22993-0_23

APA

Cohen, D. A., Creed, P., Jeavons, P. G., & Živný, S. (2011). An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. In Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011: Proceedings (pp. 231-242). (Lecture Notes in Computer Science; Vol. 6907). Springer. https://doi.org/10.1007/978-3-642-22993-0_23

Vancouver

Cohen DA, Creed P, Jeavons PG, Živný S. An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. In Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011: Proceedings. Springer. 2011. p. 231-242. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-22993-0_23

Author

Cohen, David A. ; Creed, Páidí ; Jeavons, Peter G. ; Živný, Stanislav. / An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011: Proceedings. Springer, 2011. pp. 231-242 (Lecture Notes in Computer Science).

BibTeX

@inproceedings{be6298a748ba40659904e8391d3e875c,
title = "An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection",
author = "Cohen, {David A.} and P{\'a}id{\'i} Creed and Jeavons, {Peter G.} and Stanislav {\v Z}ivn{\'y}",
year = "2011",
doi = "10.1007/978-3-642-22993-0_23",
language = "English",
isbn = "978-3-642-22992-3",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "231--242",
booktitle = "Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011: Proceedings",
note = "MFCS ; Conference date: 20-11-2011",

}

RIS

TY - GEN

T1 - An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection

AU - Cohen, David A.

AU - Creed, Páidí

AU - Jeavons, Peter G.

AU - Živný, Stanislav

PY - 2011

Y1 - 2011

U2 - 10.1007/978-3-642-22993-0_23

DO - 10.1007/978-3-642-22993-0_23

M3 - Conference contribution

SN - 978-3-642-22992-3

T3 - Lecture Notes in Computer Science

SP - 231

EP - 242

BT - Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011: Proceedings

PB - Springer

T2 - MFCS

Y2 - 20 November 2011

ER -