Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting

DOI10.1137/1.9781611974331.ch114zbMath1410.68166OpenAlexW4299565076MaRDI QIDQ4575698

Robert Ganian, Stefan Szeider, M. S. Ramanujan

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch114

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

CSP beyond tractable constraint languages ⋮ Backdoor Sets for CSP. ⋮ Backdoors into heterogeneous classes of SAT and CSP

This page was built for publication: Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting