servers have different fail rates.
amit wrote:
> Where did you find this problem? Does it have a practical application
> you know of?
> It is interesting. Do you have any thoughts about its solution?
>
> On Mar 10, 11:50 pm, Jim wrote:
> > sorry, I fail to understand "the
computing the permanent there is no such sign. you should look to book
> Complexity theory:A modern approach, by arora and (sorry i dont remeber
> second author name exactly)
>
> 2009/3/10 Jim
>
> >
> > sorry, I fail to understand "the permanent" :-(
> &g
it is
> different problem, because the input if of log n size, as if it was in your
> problem.
>
> 2009/3/9, Jim :
> >
> >
> > After asking for helps from many persons who are skilled at algorithm
> > design, I suspect this problem is a NP-complete.
> > Th
oblem, because the input if of log n size, as if it was in your
> problem.
>
> 2009/3/9, Jim :
>
>
>
> > After asking for helps from many persons who are skilled at algorithm
> > design, I suspect this problem is a NP-complete.
> > The only problem you speak of whi
k
> problem(google).
>
> If you want to make any success, you should first try case when all numbers
> are power of two.
>
> 2009/3/8 Jim
>
>
>
> > it's incorrect. for example:
> > 23, 24, 26, 30, 32, 63, 64, 90, n = 2, k = 4
> > the minimum split
ake any success, you should first try case when all numbers
> are power of two.
>
> 2009/3/8 Jim
>
>
>
> > it's incorrect. for example:
> > 23, 24, 26, 30, 32, 63, 64, 90, n = 2, k = 4
> > the minimum split is [26, 30, 32, 90] [23, 24, 63, 64]
> > the sum
. ?
>
> 2009/3/8 Jim
>
>
>
> > Given a set of k*n positive numbers, we can split this set into n
> > partitions, each partition with k numbers. Now, we multiply the
> > numbers in each partition, got n products, then we have a sum of n
> > products. How can w
Given a set of k*n positive numbers, we can split this set into n
partitions, each partition with k numbers. Now, we multiply the
numbers in each partition, got n products, then we have a sum of n
products. How can we split this set to minimize this total sum?
It's easy to show this problem is NP
