External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Subexponential Time Complexity of CSP with Global Constraints

Ronald de Haan, Iyad A. Kanj, Stefan Szeider. Subexponential Time Complexity of CSP with Global Constraints. In Barry O'Sullivan, editor, Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings. Volume 8656 of Lecture Notes in Computer Science, pages 272-288, Springer, 2014. [doi]

Authors

Ronald de Haan

This author has not been identified. Look up 'Ronald de Haan' in Google

Iyad A. Kanj

This author has not been identified. Look up 'Iyad A. Kanj' in Google

Stefan Szeider

This author has not been identified. Look up 'Stefan Szeider' in Google
runs on