Subexponential time complexity of CSP with global constraints

Ronald De Haan; Iyad Kanj; Stefan Szeider

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

Subexponential time complexity of CSP with global constraints

Ronald De Haan
, Iyad Kanj
, Stefan Szeider

Oesterreichische Nationalbank and Vienna University of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Proceedings
Publisher	Springer Verlag
Pages	272-288
Number of pages	17
ISBN (Print)	9783319104270
DOIs	https://doi.org/10.1007/978-3-319-10428-7_21
State	Published - 2014
Event	20th International Conference on the Principles and Practice of Constraint Programming, CP 2014 - Lyon, France Duration: Sep 8 2014 → Sep 12 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8656 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	20th International Conference on the Principles and Practice of Constraint Programming, CP 2014
Country/Territory	France
City	Lyon
Period	9/8/14 → 9/12/14

ASJC Scopus Subject Areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

De Haan, R., Kanj, I., & Szeider, S. (2014). Subexponential time complexity of CSP with global constraints. In Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Proceedings (pp. 272-288). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8656 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-10428-7_21

Subexponential time complexity of CSP with global constraints. / De Haan, Ronald; Kanj, Iyad; Szeider, Stefan.
Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Proceedings. Springer Verlag, 2014. p. 272-288 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8656 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

De Haan, R, Kanj, I & Szeider, S 2014, Subexponential time complexity of CSP with global constraints. in Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8656 LNCS, Springer Verlag, pp. 272-288, 20th International Conference on the Principles and Practice of Constraint Programming, CP 2014, Lyon, France, 9/8/14. https://doi.org/10.1007/978-3-319-10428-7_21

De Haan R, Kanj I, Szeider S. Subexponential time complexity of CSP with global constraints. In Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Proceedings. Springer Verlag. 2014. p. 272-288. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-10428-7_21

De Haan, Ronald ; Kanj, Iyad ; Szeider, Stefan. / Subexponential time complexity of CSP with global constraints. Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Proceedings. Springer Verlag, 2014. pp. 272-288 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{582a1881437949dcac28a36a49301d12,

title = "Subexponential time complexity of CSP with global constraints",

author = "\{De Haan\}, Ronald and Iyad Kanj and Stefan Szeider",

year = "2014",

doi = "10.1007/978-3-319-10428-7\_21",

language = "English",

isbn = "9783319104270",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "272--288",

booktitle = "Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Proceedings",

note = "20th International Conference on the Principles and Practice of Constraint Programming, CP 2014 ; Conference date: 08-09-2014 Through 12-09-2014",

}

TY - GEN

T1 - Subexponential time complexity of CSP with global constraints

AU - De Haan, Ronald

AU - Kanj, Iyad

AU - Szeider, Stefan

PY - 2014

Y1 - 2014

UR - https://www.scopus.com/pages/publications/84906267598

UR - https://www.scopus.com/pages/publications/84906267598#tab=citedBy

U2 - 10.1007/978-3-319-10428-7_21

DO - 10.1007/978-3-319-10428-7_21

M3 - Conference contribution

AN - SCOPUS:84906267598

SN - 9783319104270

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 272

EP - 288

BT - Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Proceedings

PB - Springer Verlag

T2 - 20th International Conference on the Principles and Practice of Constraint Programming, CP 2014

Y2 - 8 September 2014 through 12 September 2014

ER -

Subexponential time complexity of CSP with global constraints

Publication series

Conference

ASJC Scopus Subject Areas

Access to Document

Other files and links

Cite this