Timeline for Use Do to evaluate an expression over two indices $i \ne j$ (over a list of tuples)?
Current License: CC BY-SA 3.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 26, 2015 at 22:05 | vote | accept | Laura | ||
May 23, 2015 at 5:43 | answer | added | ubpdqn | timeline score: 2 | |
May 23, 2015 at 3:47 | history | edited | J. M.'s missing motivation♦ | CC BY-SA 3.0 |
edited title
|
May 22, 2015 at 22:11 | answer | added | kglr | timeline score: 1 | |
May 22, 2015 at 21:42 | comment | added | JimB | One possibility might be to sum over all combinations of $i$ and $j$ and then subtract out the combinations where $i=j$. This might not be the most machine efficient approach but if you only have 4*4 combinations to look at, it won't matter. | |
May 22, 2015 at 21:38 | answer | added | Basheer Algohi | timeline score: 1 | |
May 22, 2015 at 21:31 | history | asked | Laura | CC BY-SA 3.0 |