Anonymous user
Talk:Special Ordered Sets of Type N: Difference between revisions
Talk:Special Ordered Sets of Type N (view source)
Revision as of 15:39, 26 January 2012
, 12 years ago→Duplicate?: format tweak
(If it is a dupe then try to get the older, bigger one changed) |
m (→Duplicate?: format tweak) |
||
Line 3:
After all the really complicated explanation that probably needs to be cleaned up if this is to become a task, it sounds a lot like [[Greatest subsequential sum]]. Is this a duplicate? Or at least too close to add value? --[[User:Mwn3d|Mwn3d]] 18:23, 25 January 2012 (UTC)
:I can see how you might think that. My title is much better of course, and has a wiki link.<br>[[User:Nigel Galloway|Nigel Galloway]] 14:38, 26 January 2012 (UTC)
::If it is the same idea then I would suggest trying to get the existing task changed rather than make a whole new one, since there are already a lot of examples there. If the other task needs more information then bring it up on [[Talk:Greatest subsequential sum|its talk page]]. We can rename that task and add WP links easily, but we need to agree on the name and the task content. --[[User:Mwn3d|Mwn3d]] 15:16, 26 January 2012 (UTC)
| |||