Dag Sverre Seljebotn student.matnat.uio.no> writes:
>
> Paul Northug wrote:
> > I have a computation bounded by one step and I have always wondered
> > how to make it fast enough to be useable. I suspect that I have to use
> > an approximation, but I was hoping someone would spot a major
> > inef
Paul Northug wrote:
> I have a computation bounded by one step and I have always wondered
> how to make it fast enough to be useable. I suspect that I have to use
> an approximation, but I was hoping someone would spot a major
> inefficiency in my implementation.
>
> The calculation is a kind of o
I have a computation bounded by one step and I have always wondered
how to make it fast enough to be useable. I suspect that I have to use
an approximation, but I was hoping someone would spot a major
inefficiency in my implementation.
The calculation is a kind of outer product of two sets of time
