Subexponential Time Complexity of CSP with Global Constraints

Haan, Ronald de; Kanj, Iyad A.; Szeider, Stefan

doi:10.1007/978-3-319-10428-7_21

by Ronald de Haan, Iyad A. Kanj, Stefan Szeider

Reference:

Subexponential Time Complexity of CSP with Global ConstraintsRonald de Haan, Iyad A. Kanj, Stefan SzeiderPrinciples and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings (Barry O'Sullivan, ed.), volume 8656 of Lecture Notes in Computer Science, pages 272-288, 2014, Springer Verlag.

Bibtex Entry:

@string{lncs="Lecture Notes in Computer Science"}
@string{springer="Springer Verlag"}
@inproceedings{DeHaanKanjSzeider14b,
  author    = {Ronald de Haan and Iyad A. Kanj and Stefan Szeider},
  title     = {Subexponential Time Complexity of {CSP} with Global Constraints},
  booktitle = {Principles and Practice of Constraint Programming - 20th International
               Conference, {CP} 2014, Lyon, France, September 8-12, 2014. Proceedings},
  pages     = {272-288},
  year      = {2014},
  doi       = {10.1007/978-3-319-10428-7_21},
  editor    = {Barry O'Sullivan},
  series    = LNCS,
  volume    = {8656},
  publisher = Springer,
  url = {http://www.kr.tuwien.ac.at/research/reports/rr1406.pdf},
}