25 May
2012
25 May
'12
9:07 a.m.
On 05/25/2012 03:17 PM, Robert Kern wrote:
On Thu, May 24, 2012 at 5:52 PM, Robert Kernrobert.kern@gmail.com wrote:
(Hmm, now that I think about it, the edge cases are when the strides are 0 or negative. 0-stride axes can simply be removed, and I think we should be able to work back to a first item and flip the sign on the negative strides. The typical positive-stride solution can be found in an open source C++ global array code, IIRC. Double-hmmm...)
Except that it's still NP-complete.
Well, I guess N would be the number of dimensions, so that by itself doesn't tell us all that much. Question is if the worst case is no better than the trivial O(number of elements in the matrices), which would be bad.
Dag