On the Subexponential-Time Complexity of CSP

DOI10.1613/jair.4540zbMath1323.68325OpenAlexW2129131081WikidataQ129489682 ScholiaQ129489682MaRDI QIDQ5176853

Stefan Szeider, Ronald de Haan, Iyad A. Kanj

Publication date: 4 March 2015

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.4540

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Tractability in constraint satisfaction problems: a survey ⋮ Improved FPT algorithms for weighted independent set in bull-free graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms

This page was built for publication: On the Subexponential-Time Complexity of CSP