On the Minimal Constraint Satisfaction Problem: Complexity and Generation
From MaRDI portal
Publication:5743544
DOI10.1007/978-3-319-26626-8_54zbMath1473.68186OpenAlexW2406415335MaRDI QIDQ5743544
Barry O'Sullivan, Guillaume Escamocher
Publication date: 5 February 2016
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_54
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
Cites Work