Timeline for XOR pair frequency queries
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 19, 2023 at 14:04 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 20, 2023 at 12:38 | answer | added | Command Master | timeline score: 0 | |
| Aug 20, 2023 at 11:31 | comment | added | Command Master | The xor is in the exponent, not the coefficients, so I don't see how FFT could be useful | |
| Aug 20, 2023 at 11:11 | answer | added | gnasher729 | timeline score: 0 | |
| Aug 20, 2023 at 9:53 | answer | added | gnasher729 | timeline score: 0 | |
| Aug 17, 2023 at 19:25 | answer | added | DirkT | timeline score: 1 | |
| Aug 17, 2023 at 16:14 | comment | added | D.W.♦ | en.wikipedia.org/wiki/Discrete_Fourier_transform_over_a_ring, en.wikipedia.org/wiki/Cyclotomic_fast_Fourier_transform | |
| Aug 17, 2023 at 9:46 | comment | added | bihariforces | @DirkT yes, for each query. | |
| Aug 17, 2023 at 8:23 | comment | added | DirkT | For Your array $a$, you want to count the index pairs, $(i,j)$ for which $(a_i \operatorname{xor} a_j) = k$, is that correct? | |
| Aug 17, 2023 at 6:33 | history | asked | bihariforces | CC BY-SA 4.0 |