Description
Investigates computer science advances in the nature of classifying the inherent hardness of computational problems. Knowing the inherent difficulty of a problem gives insight on what computing and communication resources are required for its efficient solution. The course will also investigate how trade-offs in time, memory, and randomness affect computational power.
General Information
No information, yet. Stay tuned!
| Name | Office Hours | |
|---|---|---|
Abbas Naderi | When? Where? | |
Mohammad Mahmoody | When? Where? |
Lecture Notes
1 - 50 of 52
Lecture Notes
Lecture Date
Apr 24, 2014
Apr 22, 2014
Apr 17, 2014
Apr 17, 2014
Apr 15, 2014
Apr 15, 2014
Apr 10, 2014
Apr 10, 2014
Apr 8, 2014
Apr 8, 2014
Jan 23, 2014
Apr 3, 2014
Apr 3, 2014
Apr 1, 2014
Apr 1, 2014
Apr 1, 2014
Mar 27, 2014
Mar 27, 2014
Mar 25, 2014
Mar 25, 2014
Mar 20, 2014
Mar 20, 2014
Mar 18, 2014
Mar 18, 2014
Mar 6, 2014
Mar 6, 2014
Mar 4, 2014
Mar 4, 2014
Feb 27, 2014
Feb 27, 2014
Feb 20, 2014
Feb 20, 2014
Feb 18, 2014
Feb 18, 2014
Feb 11, 2014
Feb 11, 2014
Feb 6, 2014
Feb 6, 2014
Feb 4, 2014
Feb 4, 2014
Jan 30, 2014
Jan 30, 2014
Jan 28, 2014
Jan 28, 2014
Jan 23, 2014
Jan 23, 2014
Jan 21, 2014
Jan 21, 2014
Jan 16, 2014
Jan 16, 2014
1 - 50 of 52
Homework
Homework
Due Date
Apr 29, 2014
Apr 10, 2014
Mar 21, 2014
Feb 20, 2014
Jan 30, 2014