Tractable decision for a constraint language implies tractable search

DOI10.1023/B:CONS.0000036045.82829.94zbMath1074.68061OpenAlexW2054511082MaRDI QIDQ1768749

David A. Cohen

Publication date: 15 March 2005

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:cons.0000036045.82829.94

zbMATH Keywords

complexitytractability

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

CLAP: A New Algorithm for Promise CSPs ⋮ Domain permutation reduction for constraint satisfaction problems ⋮ The power of propagation: when GAC is enough ⋮ Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight ⋮ Structural tractability of enumerating CSP solutions

This page was built for publication: Tractable decision for a constraint language implies tractable search