พูดคุย:Computing the volume of partitions in boolean cubes

ทำไมบางที font math มันก็ตัวเล็ก เดี๋ยวก็ตัวใหญ่ฟระ -- Jung 08:25, 28 มีนาคม 2007 (ICT)

comments

• I don't understand why the running time is $O(k*n^{4})$? Where does k come from? Is it from the complexity of the partition? Or... is it from the fact that you have to compute the volume of every partition? (do you?) But having k in the factor should be fine, right? Because you have to specify k points (for S) anyway. Am I missing something here? -- Jittat 23:30, 28 มีนาคม 2007 (ICT)

• That's true. I am just not satisfied with the way of calculating $O(n^{4})$ for every points; I hope it will be an easier and more intuitive way. Jung 15:06, 30 มีนาคม 2007 (ICT)