Timeline for Can you identify the sum of two permutations in polynomial time?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://cs.stackexchange.com/ with https://cs.stackexchange.com/
|
|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Jul 7, 2013 at 14:41 | history | edited | Mohammad Al-Turkistany |
Added permutations Tag
|
|
| Jun 22, 2013 at 16:41 | comment | added | Mohammad Al-Turkistany | BTW, A simple variation came up to my mind and I am not sure about its complexity. Can you identify the fixed-point free sum of two permutations in polynomial time? (We require that the two permutations disagree at each position i.e. $\pi_i \ne \sigma_i$ for all $i$) | |
| Jun 18, 2013 at 13:13 | answer | added | anonymous moose | timeline score: 4 | |
| Jun 17, 2013 at 17:21 | vote | accept | Peter Shor | ||
| Jun 17, 2013 at 10:30 | history | edited | Mohammad Al-Turkistany |
edited tags
|
|
| Jun 17, 2013 at 10:29 | answer | added | Mohammad Al-Turkistany | timeline score: 20 | |
| Jun 16, 2013 at 17:01 | history | tweeted | twitter.com/#!/StackCSTheory/status/346311482025324545 | ||
| Jun 16, 2013 at 15:04 | history | asked | Peter Shor | CC BY-SA 3.0 |