Timeline for A Bitwise Xor Problem
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 10, 2018 at 11:01 | history | edited | Ben Barber | CC BY-SA 4.0 |
top-level tag, remove deprecated tag and copy edit
|
| May 23, 2018 at 5:00 | vote | accept | zbh2047 | ||
| May 22, 2018 at 17:02 | answer | added | Emil Jeřábek | timeline score: 6 | |
| May 21, 2018 at 13:18 | comment | added | Per Alexandersson | @zbh2047: That is a proof - I have a paper where we reduce the problem (this reduction is quite non-trivial), to "only" 90.000 cases, about, which we check by computer. | |
| May 21, 2018 at 12:31 | comment | added | zbh2047 | Yes, I do. I use the simplest way to write a program that spends $O(pqn)$ time to validate the results. | |
| May 21, 2018 at 11:08 | comment | added | Jeppe Stig Nielsen | @zbh2047 Do you mean you already validated that $a_i\le 2^{12}$ for all $1\le i \le 1000$ and all $p,q\le 1000$, by brute force (computer program)? | |
| May 21, 2018 at 9:32 | comment | added | zbh2047 | I draw the conclusion by enumerating all of $p,q,n$, but this approch is too awful! I think It can only be used to validate a conclusion, not prove. | |
| May 21, 2018 at 9:15 | comment | added | Per Alexandersson | Is it not possible to brute-force that range of numbers? In particular with some clever dynamic programming? | |
| May 21, 2018 at 8:48 | history | asked | zbh2047 | CC BY-SA 4.0 |