CS 880 - Advanced Complexity Theory Spring 2008

Lecture Notes

For information on how to write up your scribe notes in LaTeX, check out these guidelines.

	Date	Topic	Scribe
1	1/23	Introduction	Jeff Kinne
2	1/25	Background on Harmonic Analysis	Priyananda Shenoy
3	1/28	Harmonic Analysis over Finite Groups	Adeel Pervez
4	1/30	Linearity Testing	Dalibor Zeleny
5	2/1	Dictatorship Testing	Scott Diehl
6	2/4	Influence and Noise Sensitivity	David Malec
7	2/8	Passive Learning	Thomas Watson
8	2/11	Active Learning	Chi Man Liu
9	2/13	Learning DNFs	Matt Anderson
10	2/15	Hypercontractivity	Baris Aydinlioglu
11	2/18	Concentration on Influential Variables	Seeun Umboh
12	2/20	Social Choice Theory	Mark Liu
13	2/22	Average-Case Hardness	Thomas Watson
14	2/25	Hardness Amplification	Adeel Pervez
15	2/29	Hardness Amplification within NP	Priyananda Shenoy
16	3/3	Noise Sensitivity of Majority	Chi Man Liu
17	3/5	Hardness of Approximation	David Malec
18	3/7	Inapproximability of Maximum 3-SAT	Jeff Kinne
19	3/10	Inapproximability of Maximum Cut	Matt Anderson
20	3/12	Inapproximability of Minimum Vertex Cover	Mark Liu
21	3/14	Small-Bias Pseudorandom Generators	Dalibor Zeleny
22	3/24	Biased Harmonic Analysis	Baris Aydinlioglu
23	3/26	Threshold Phenomena	Seeun Umboh
24	3/31	Additive Combinatorics	Scott Diehl
25	4/4	Coding Theory	Dalibor Zeleny
26	4/9	The Harmonic Sieve	Baris Aydinlioglu
27	4/11	Influence in Decision Trees	Mark Liu
28	4/18	Uniform Hardness Amplification	Seeun Umboh
29	4/21	Metric Embeddings	David Malec