Implementing a test for tractability

DOI10.1023/B:CONS.0000024049.41091.71zbMath1074.68610OpenAlexW1977364512MaRDI QIDQ1768752

Richard L. Gault, Peter G. Jeavons

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.0000024049.41091.71

zbMATH Keywords

symmetrycomplexitypolymorphismconstraint languagePolyanna

Mathematics Subject Classification ID

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

Related Items

A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ Domain permutation reduction for constraint satisfaction problems ⋮ Representing and solving finite-domain constraint problems using systems of polynomials ⋮ The smallest hard trees