Timeline for Maximize combinatorial sum for boolean function
Current License: CC BY-SA 3.0
2 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 24, 2014 at 4:52 | comment | added | user56357 | Actually, this expression can be reformulated with help of q-Krawtchouk polynomials and it was a staring point. Unfortunately, nobody knows the way to predict, whether a given Krawtchouk polynomial is greater than $0$. | |
Jul 23, 2014 at 19:49 | history | answered | Robert Israel | CC BY-SA 3.0 |