blogmarks.net Get Firefox!

American Scientist Online - The Easiest Hard Problem

11 month ago

gleuschk : American Scientist Online - The Easiest Hard Problem - partitioning a set of integers into two subsets of equal sum: NP-complete

Tags : compsci math p=np partitions

  copy
xml
Upian.