[...] Homework 0 is now online. It will be due next Monday by midnight. Note that when I’ve asked for an algorithm with a specific running time, partial credit will be given for algorithms with slower running times. Unless otherwise specified, I expect to see formal arguments for correctness and running time bounds. Effort, even in the service of a failed solution, will be acknowledged.The last problem is starred, which signifies that (in my mind) it is hard. [...]
August 20th, 2007 at 6:15 pm
[...] Homework 0 is now online. It will be due next Monday by midnight. Note that when I’ve asked for an algorithm with a specific running time, partial credit will be given for algorithms with slower running times. Unless otherwise specified, I expect to see formal arguments for correctness and running time bounds. Effort, even in the service of a failed solution, will be acknowledged.The last problem is starred, which signifies that (in my mind) it is hard. [...]
August 20th, 2007 at 6:24 pm
What is the algorithm for handing in the homework?
August 20th, 2007 at 8:26 pm
It says computation geometry on it. Is this correct?
August 23rd, 2007 at 9:07 am
For problem 3 - coloring a graph, do we have to use randomization algorithm? or we can use other algorithm.
Thanks,
Jimmy
August 23rd, 2007 at 12:26 pm
For submitting homeworks:
* if you’re submitting electronically, email me.
* if you’re submitting by paper, slide it under my door
For Problem 3: You can use any algorithm you like. the randomized one is easier
August 25th, 2007 at 9:08 pm
It’s due by midnight (or “11:59pm”) on Monday?
August 25th, 2007 at 11:24 pm
Either. I won’t give you a hard time