I was wondering if it's something to do with normal distribution or central limit theorem but honestly, I have no idea at all on how to solve this question
#4
candyduz
3
0
I tried to approximate normal to binomial and out of groups of 20 flips, for the first set, I got 10, 6, 9, 8, 8, 11, 11, 10, 9, 11 "0"s and for the second set, I got 12, 9, 9, 9, 10, 12, 10, 12, 11, 11 "0"s.
It's easy to see that any polynomial is function of that class. Also it seems that composition of exponent and polynomial is good as well. G_f(a, b) should be equal G_f(b, a) as the f(a+b) is symmetrical.
Does anyone have information about this or at least related to it?
Hi!
I am struggling with the exercise I mentioned under "Homework statement".
The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf
Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm:
Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed.
I thought...