Department of Computer Science, Aarhus University
Volume 20 (2012)
(compatible with EndNote, Reference Manager, ProCite, RefWorks)
(compatible with BibDesk, LaTeX)
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.
Already have an account? Login in here