Instructor: Leonard Schulman CCB 234, schulman@cc.gatech.edu, 404-894-6438, office hours R 2-3 or by appointment.
TA: Enylton Machado Coelho
CCB 153, machado@cc.gatech.edu, 404-894-1155, office hours M 1-2:30.
Class: MW 3-4:30, Skiles 240.
The final exam will be a take-home. As discussed in class on the 10/Apr, it will be handed out on Wednesday the 26/Apr (the last day of class), and it will be due on Monday the 1/May. Final exam clarifications posted here if needed.
Handout #1 PS #1
Handout #2 PS #2
Handout #3 PS #3
Handout #4 PS #4
Handout #5 PS #5
Handout #6 PS #6
Handout #7 PS #7
Handout #8 PS #8
Handout #9 PS #9
Handout #10 PS #10
Handout #11 PS #11
Scribe Notes
Template for scribe notes. Instructions for scribes: please write the notes in latex using the template (and make sure that they latex properly on a "vanilla" unix system). Then meet Enylton to go over the notes; he'll give you comments for revision and try to resolve any questions you have. Also any remaining questions can be directed to me at this point. Finally, the latex file should reach me and I'll edit it and post the notes here.
If you need information about latex, try this site.
Posted to date: lectures 1, 2, 3, 5, 6, 8, 9, 10, 11, 13, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28. Missing: 4, 7. Coming: 12. I plan at some point to write up lecture 29 but not necessarily in time for the end of the semester. (It won't be covered on the final.)
(1) 10/Jan: Matrix multiplication. Scribe: Khai Truong.
(2) 12/Jan: Matrix multiplication, inversion, Boolean matrix multiplication. Scribe: Jonathan Diaz.
(3) 19/Jan: Least squares approximation. Integer multiplication. Linear systems. Scribe: David Robinson.
(4) 24/Jan: Fast Fourier Transform. Scribe: Namgeun Jeong (missing).
(5) 26/Jan: String matching w. "jokers". Cryptography. Scribe: Ying Liu.
(6) 31/Jan: Elementary number theory. Scribe: Hao Wu.
(7) 2/Feb: Elementary number theory. Scribe: Keith Nielsen (missing).
(8) 7/Feb: Graphs. Lecturer: Enylton Coelho.
(9) 9/Feb: Graph algorithms (BFS). Lecturer: Enylton Coelho.
(10) 14/Feb: RSA encryption. Scribe: Scott McManus.
(11) 16/Feb: RSA digital signatures. Scribe: Ning Tan.
(12) 21/Feb: Equivalence of complexity of some tasks for cracking RSA. Scribe: Jaideep Dharap.
(13) 23/Feb: Rabin and El Gamal encryption. Shank's algorithm for the discrete logarithm. Scribe: Hao Wu.
(14) 28/Feb: Review.
(15) 1/Mar: Graph algorithms (DFS and applications). Lecturer: Enylton Coelho.
(16) 13/Mar: Rigid string matching. Scribe: Jefferson Wu.
(17) 15/Mar: Rigid string matching. Scribe: Lixiang Sun.
(18) 20/Mar: Dynamic programming. Scribe: Ning Tan.
(19) 22/Mar: Dynamic programming. Computational geometry. Scribe: Ying Liu.
(20) 27/Mar: Computational geometry: convex hulls. Scribe: Paul Brooks.
(21) 29/Mar: Computational geometry: convex hulls. Scribe: Jeff Weir.
(22) 3/Apr (cont. on 5/Apr): Computational geometry: planar Voronoi diagrams.
(23) 5/Apr: Introduction to complexity theory: P and NP. Scribe: David Robinson.
(24) 10/Apr: Complexity theory: NP-completeness of SAT and 3SAT. Scribe: Scott McManus.
(25) 12/Apr: Complexity theory: NP-completeness of independent set, clique, and other problems. Scribe: Khai Truong.
(26) 17/Apr: Complexity theory: Hamilton cycle, graph isomorphism, approximation of vertex cover. Scribe: Jeff Weir.
(27) 19/Apr: Traveling salesman problem: approximation and inapproximability.
(28) 24/Apr: Approximation algorithm for set cover. One-way functions.
(29) 26/Apr: Equivalence of weak and strong one-way functions. Factoring.