"On the Subexponential-Time Complexity of CSP."

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

Details and statistics

DOI: 10.1613/JAIR.4540

access: open

type: Journal Article

metadata version: 2019-01-21

a service of  Schloss Dagstuhl - Leibniz Center for Informatics