Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CP
/
Paper
Subexponential Time Complexity of CSP with Global Constraints.
Ronald de Haan
,
Iyad A. Kanj
,
Stefan Szeider
Venue
A
CP
Year
2014
Proceedings
CP
DBLP record
conf/cp/HaanKS14 ↗
Browse the full
CP paper archive
.