I have posted the final grades in SIS, so you should be able to see them soon (at least by tomorrow).
Comments on the final exam: [PDF]
Thanks everyone for a great semester, and enjoy your summer!
|
||||||
|
This page: Conveying Complexity Highlights contains links to some of the most interesting, illuminating, and/or entertaining submissions for PS7. Enjoy watching the movies, listening to the music, and playing the games! (Alas, HTTP 1.1 does not provide any support for transmitting cakes, however.)
    The final exam is Thursday, May 13, 9am-noon (as scheduled by the registrar). It covers the whole course:
It will be similar to Exams 1 and 2 except that no resources may be used (no notes at all!). I will be out of town Thursday [More...] Sorry, I was wrong for one of the Jeopardy answers today! n! is not in O(2n). It is easy to see that n! < nn, since all the numbers in the product to compute n! are less than (or equal to) n, but this doesn’t prove it is not in O(2n). For that, we can use Sterling’s approximation which gives a tight approximation of the value of n! as which is definitely not in O(2n) since the base of [More...] Please submit your PS7 by posting a comment to this post. Some reminders from the PS7 handout are below, see that handout for full details. If you work in a team, your team should jointly post a single submission with all of your names on it. Your post should include: In class, someone asked about languages known to be in BQP that are not known to be in NP. There is at least one such language, known as the Recursive Fourier Sampling problem. It is described in this paper: Quantum complexity theory by Ethan Bernstein and Umesh Vazirani, ACM Symposium on Theory of Computing, 1993. [Full version: PDF] Section 8.4 of this paper describes the problem, but it [More...] I have uploaded your scores on assignments into Collab so you can now verify that I have all your scores recorded correctly. If you notice any discrepancies, please let me know. Since I badly messed up the reduction from SUBSET-SUM to KNAPSACK, and don’t see an obvious way to fix this, you can solve this question in place of Problem 5 on PS6. If you get an especially elegant and convincing answer that you would like to present in class Tuesday, send it to me by Monday afternoon. The reading handed out today is available here: The Status of the P versus NP Problem, [More...] Problem Sets 6 and 7 are now posted. Problem Set 7 is quite different from all the other problem sets. Although it is not due until the last day of class, I strongly encourage everyone to read it now (only one page) and start thinking about what you want to do for it. You do not need to wait until you finish PS6 to start PS7 (and I would recommend starting on it earlier). Exam 2 Comments: [PDF]
The next reading assignment is Sipser, Chapter 7. (We are skipping Chapter 6.) Problem Set 6, originally scheduled to be due on April 20th on the syllabus, will now be due on April 27 (and will be posted soon). Exam 2 is here: [PDF] [LaTeX Template] Exam 2 is due at the beginning of class Tuesday. I won’t be holding office hours tomorrow. Good luck with your exams! Problem Set 5 Comments: [PDF] Sorry, I will not be able to hold my usual Thursday morning this week. Instead, I will have office hours Thursday 11am-1pm. Kate McDowell is looking for students to join the Technology Committee of the Student Council, which she is chairing next year. They are looking for students with a passion for technology, and all majors and experience levels are welcome. Projects will include:
To apply, visit http://www.uvastudentcouncil.com. Contact Kate McDowell (kam6zx) for details. Exam 2 will be handed out Thursday, April 8 and due Tuesday, April 13. It will cover everything through today’s class (Barbara Liskov’s lecture), but emphasize things that have been covered since Exam 1: class 10-18, Problem sets 4 and 5. If you have any topics you would like me to review in class Tuesday, or questions you want me to go over, please post them here. As a separate game theory challenge, if exactly ONE student in [More...] |
||||||
|
This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 United States License. |
||||||