Timeline for NP-Hard solution question
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 14, 2010 at 3:02 | comment | added | Suresh Venkat | I suspect he's trying to solve partition. | |
| Oct 13, 2010 at 11:41 | comment | added | David E Speyer | Sorting a set of n numbers only takes n log n steps, so you can do that in preprocessing without effecting whether your algorithm is polynomial. | |
| Oct 12, 2010 at 22:39 | vote | accept | joseph | ||
| Oct 12, 2010 at 22:39 | vote | accept | joseph | ||
| Oct 12, 2010 at 22:39 | |||||
| Oct 12, 2010 at 22:38 | comment | added | joseph | I am solving if it is possible to divide set of Z numbers to two groups with same value. only thing that is specific is, that I need to order numbers from smallest to highest. | |
| Oct 12, 2010 at 18:34 | history | answered | Ross Churchley | CC BY-SA 2.5 |