Complexity of Chess Domination Problems
From MaRDI portal
Publication:6416821
arXiv2211.05651MaRDI QIDQ6416821
Alexis Langlois-Rémillard, Érika Roldán, Christoph Müßig
Publication date: 10 November 2022
Combinatorics in computer science (68R05) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of packing and covering (05B40) Polyominoes (05B50) Recreational mathematics (00A08) Computational aspects of satisfiability (68R07)
This page was built for publication: Complexity of Chess Domination Problems