# Re: Imaginary Polynomial Time Algorithm for Subset sum Problem

*From*: Patricia Shanahan <pats@xxxxxxx>*Date*: Thu, 06 Mar 2008 15:42:36 -0800

Tim Tyler wrote:

Jym wrote:

And that's also the problem with the OP stamping process: it can copy an arbitrarily large number of dots in a single unit of time. While on any realistic computer/model, copying an array (typically), would take time proportional to its size.

FWIW, copying an array does not take up time which is proportional to the size of the array on a parallel computer.

Are you assuming a bounded or unbounded number of processors?

Patricia

.

**Follow-Ups**:**Re: Imaginary Polynomial Time Algorithm for Subset sum Problem***From:*Tim Tyler

**References**:**Imaginary Polynomial Time Algorithm for Subset sum Problem***From:*HorkGames

**Re: Imaginary Polynomial Time Algorithm for Subset sum Problem***From:*Patricia Shanahan

**Re: Imaginary Polynomial Time Algorithm for Subset sum Problem***From:*Tim Tyler

**Re: Imaginary Polynomial Time Algorithm for Subset sum Problem***From:*Jym

**Re: Imaginary Polynomial Time Algorithm for Subset sum Problem***From:*Tim Tyler

**Re: Imaginary Polynomial Time Algorithm for Subset sum Problem***From:*Jym

**Re: Imaginary Polynomial Time Algorithm for Subset sum Problem***From:*Tim Tyler

**Re: Imaginary Polynomial Time Algorithm for Subset sum Problem***From:*Jym

**Re: Imaginary Polynomial Time Algorithm for Subset sum Problem***From:*Tim Tyler

- Prev by Date:
**Re: Imaginary Polynomial Time Algorithm for Subset sum Problem** - Next by Date:
**Re: An intuitive reason why P=BPP** - Previous by thread:
**Re: Imaginary Polynomial Time Algorithm for Subset sum Problem** - Next by thread:
**Re: Imaginary Polynomial Time Algorithm for Subset sum Problem** - Index(es):