"Subexponential Time Complexity of CSP with Global Constraints."

Ronald de Haan, Iyad A. Kanj, Stefan Szeider (2014)

Details and statistics

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

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

a service of  Schloss Dagstuhl - Leibniz Center for Informatics