Minimum sub-sequence sum

From: Michael Jarrod <Michael.Jarrod@xxxxxxxxx>
Date: Mon, 21 Jul 2008 20:14:17 -0700 (PDT)

Hello,

I have a sequence of integers (positive/negative values) and i would
like to find the sub sequence of consecutive values that yields the
smallest sum, I can think of a very simple O(n^3) complex solution,
however I was wondering are there any better solutions? and what is
the name of this kind of problem?

-Mich
.

Follow-Ups:
- Re: Minimum sub-sequence sum
  - From: Gerry Myerson

Prev by Date: Re: Character of the squared tensor of a G-module
Next by Date: Hyperbolic Geometry book recommendation please
Previous by thread: Half of SR and GR correct
Next by thread: Re: Minimum sub-sequence sum
Index(es):
- Date
- Thread

Relevant Pages

Re: Minimum sub-sequence sum
... like to find the sub sequence of consecutive values that yields the ... smallest sum, I can think of a very simple Ocomplex solution, ...
(sci.math)
Re: Minimum sub-sequence sum
... like to find the sub sequence of consecutive values that yields the ... smallest sum, I can think of a very simple Ocomplex solution, ...
(comp.programming)
Minimum sub-sequence sum
... like to find the sub sequence of consecutive values that yields the ... smallest sum, I can think of a very simple Ocomplex solution, ...
(comp.theory)
Minimum sub-sequence sum
... like to find the sub sequence of consecutive values that yields the ... smallest sum, I can think of a very simple Ocomplex solution, ...
(comp.programming)
Re: Minimum sub-sequence sum
... like to find the sub sequence of consecutive values that yields the ... smallest sum, I can think of a very simple Ocomplex solution, ... subsequence of values that are consecutive integers? ...
(comp.theory)