Revision as of 05:39, 30 October 2009 edit 98.125.232.33 (talk) No edit summary ← Previous edit		Revision as of 11:20, 31 December 2009 edit undo 169.234.128.5 (talk) →References Next edit →
Line 38: \| first = T. \| last = Takaoka \| title = Efficient algorithms for the maximum subarray problem by distance matrix multiplication \| journal = Electronic Notes in Theoretical ~~Compututer~~Computer Science \| volume = 61 \| year = 2002 \| url = http://www.cosc.canterbury.ac.nz/tad.takaoka/subarray.ps}}.

Maximum subarray problem: Difference between revisions