"On the Subexponential Time Complexity of CSP."

Iyad A. Kanj, Stefan Szeider (2013)

Details and statistics

DOI: 10.1609/AAAI.V27I1.8609

access: open

type: Conference or Workshop Paper

metadata version: 2023-09-04

a service of  Schloss Dagstuhl - Leibniz Center for Informatics