Sciweavers

FUN
2007
Springer
191views Algorithms» more  FUN 2007»

HIROIMONO Is NP-Complete

15 years 8 months ago
HIROIMONO Is NP-Complete
Daniel Andersson
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where FUN
Authors Daniel Andersson
Comments (0)