Tetravex is NP-complete
From MaRDI portal
Publication:845713
DOI10.1016/j.ipl.2006.04.010zbMath1185.68354OpenAlexW2136889863WikidataQ57481109 ScholiaQ57481109MaRDI QIDQ845713
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.04.010
Related Items
Recent results on Douglas-Rachford methods for combinatorial optimization problems, \textsc{Hanano} puzzle is \textsf{NP}-hard, On the hardness of solving edge matching puzzles as SAT or CSP problems
Cites Work