New schemes for simplifying binary constraint satisfaction problems
From MaRDI portal
Publication:3386610
DOI10.23638/DMTCS-22-1-10zbMath1477.68292OpenAlexW2953712192MaRDI QIDQ3386610
Publication date: 5 January 2021
Full work available at URL: https://hal.archives-ouvertes.fr/hal-01731250
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) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
This page was built for publication: New schemes for simplifying binary constraint satisfaction problems