Databases
StackOverflow2013
Postsdbo
POTensor Product Algorithm Optimization
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POTensor Product Algorithm Optimization
    primarykey
    data
    text
    <pre><code>double data[12] = {1, z, z^2, z^3, 1, y, y^2, y^3, 1, x, x^2, x^3}; double result[64] = {1, z, z^2, z^3, y, zy, (z^2)y, (z^3)y, y^2, z(y^2), (z^2)(y^2), (z^3)(y^2), y^3, z(y^3), (z^2)(y^3), (z^3)(y^3), x, zx, (z^2)x, (z^3)x, yx, zyx, (z^2)yx, (z^3)yx, (y^2)x, z(y^2)x, (z^2)(y^2)x, (z^3)(y^2)x, (y^3)x, z(y^3)x, (z^2)(y^3)x, (z^3)(y^3)x, x^2, z(x^2), (z^2)(x^2), (z^3)(x^2), y(x^2), zy(x^2), (z^2)y(x^2), (z^3)y(x^2), (y^2)(x^2), z(y^2)(x^2), (z^2)(y^2)(x^2), (z^3)(y^2)(x^2), (y^3)(x^2), z(y^3)(x^2), (z^2)(y^3)(x^2), (z^3)(y^3)(x^2), x^3, z(x^3), (z^2)(x^3), (z^3)(x^3), y(x^3), zy(x^3), (z^2)y(x^3), (z^3)y(x^3), (y^2)(x^3), z(y^2)(x^3), (z^2)(y^2)(x^3), (z^3)(y^2)(x^3), (y^3)(x^3), z(y^3)(x^3), (z^2)(y^3)(x^3), (z^3)(y^3)(x^3)}; </code></pre> <ul> <li>What is the fastest (fewest executions) to produce <strong>result</strong> given <strong>data</strong>? Assume, that <strong>data</strong> is variable in size, but always a factor of 4 (e.g., 4, 8, 12, etc.).</li> <li>No Boost. I am trying to keep my dependencies small. STL Algorithms are ok.</li> <li>HINT: result array size should always be 4^(multiple size) (e.g., 4, 16, 64, etc.).</li> <li>BONUS: If you can compute <strong>result</strong> just given x, y, z</li> </ul> <p>Additional examples:</p> <pre><code>double data[4] = {1, z, z^2, z^3}; double result[4] = {1, z, z^2, z^3}; double data[8] = {1, z, z^2, z^3, 1, y, y^2, y^3}; double result[16] = { ... }; </code></pre> <p><strong>I chose the accepted answer code after running this benchmark: <a href="https://gist.github.com/1232406" rel="nofollow">https://gist.github.com/1232406</a>. Basically, the top two codes were run and the one with the smallest execution time won.</strong></p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USRyan
    1. USRyan
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POTensor Product Algorithm Optimization
      1. This table or related slice is empty.
      1. VTDownMod
    2. VO
      singulars
      1. POTensor Product Algorithm Optimization
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POTensor Product Algorithm Optimization
      1. This table or related slice is empty.
      1. VTUpMod
    1. CODo you have an algorithm that's too slow, or do you need an algorithm?
      singulars
      1. POTensor Product Algorithm Optimization
      1. USSeth
    2. COIs this Homework?
      singulars
      1. POTensor Product Algorithm Optimization
      1. USAlok Save
    3. CO@Als Not homework; its for work.
      singulars
      1. POTensor Product Algorithm Optimization
      1. USRyan
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload