Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 conf/cp/HaanKS14
%A de Haan, Ronald
%A Kanj, Iyad A.
%A Szeider, Stefan
%B CP
%D 2014
%E O'Sullivan, Barry
%I Springer
%K dblp
%P 272-288
%T Subexponential Time Complexity of CSP with Global Constraints.
%U http://dblp.uni-trier.de/db/conf/cp/cp2014.html#HaanKS14
%V 8656
%@ 978-3-319-10427-0
@inproceedings{conf/cp/HaanKS14,
added-at = {2017-05-17T00:00:00.000+0200},
author = {de Haan, Ronald and Kanj, Iyad A. and Szeider, Stefan},
biburl = {https://www.bibsonomy.org/bibtex/2b333b71f60a09091284e77b11c5ca5d7/dblp},
booktitle = {CP},
crossref = {conf/cp/2014},
editor = {O'Sullivan, Barry},
ee = {https://doi.org/10.1007/978-3-319-10428-7_21},
interhash = {e3c49699fbc9846a148a00e4ae315c95},
intrahash = {b333b71f60a09091284e77b11c5ca5d7},
isbn = {978-3-319-10427-0},
keywords = {dblp},
pages = {272-288},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-05-15T15:20:02.000+0200},
title = {Subexponential Time Complexity of CSP with Global Constraints.},
url = {http://dblp.uni-trier.de/db/conf/cp/cp2014.html#HaanKS14},
volume = 8656,
year = 2014
}