Timeline for # of permutations satisfying special inequalties of each element0
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21, 2016 at 18:41 | history | edited | D.W.♦ | CC BY-SA 3.0 |
added 2 characters in body
|
| Sep 21, 2016 at 18:09 | answer | added | D.W.♦ | timeline score: 2 | |
| Sep 21, 2016 at 17:44 | history | tweeted | twitter.com/StackCompSci/status/778651158168633345 | ||
| Sep 21, 2016 at 15:09 | comment | added | D.W.♦ | 1. Do you have $f(1)=n$ and $f(n)=1$? If not, we might be able to make use of that. 2. Do you need an exact count, or would an approximate count be OK? 3. You could express this as an instance of #SAT and try applying a #SAT solver -- I don't know if it would work, but you could try it. | |
| Sep 21, 2016 at 14:36 | history | edited | Raphael |
edited tags
|
|
| Sep 21, 2016 at 13:54 | history | asked | user1743455 | CC BY-SA 3.0 |