Timeline for Paritioning a set of numbers A into two sets B,C so that abs(prod(B) - prod(C)) is minimal
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 2, 2009 at 17:49 | comment | added | Suresh Venkat | makes me wonder if a randomized fingerprinting strategy might work. | |
| Dec 2, 2009 at 4:51 | comment | added | David Eppstein | Subset sum is exponential in the number of bits of precision of its inputs. And to distinguish between integer products that may themselves be exponential in the input numbers, you need a polynomial number of bits of precision. So this doesn't seem to be good enough. | |
| Dec 2, 2009 at 3:20 | history | answered | Suresh Venkat | CC BY-SA 2.5 |