1) Department of Computer Science, Aarhus University
puzzles, combinatorics, computational complexity, NP-completeness
In a Magnets puzzle, one must pack magnets in a box subject to polarity and numeric constraints. We show that deciding solvability of Magnets instances is NP-complete.
Edited and published by : Information Processing Society of Japan Produced and listed by : SANBI Printing Co. Ltd