CS254, the new Stanford graduate course on computational complexity started this week.
It is a condensed version of my Berkeley course in only 17 lectures (plus two lectures on quantum complexity theory). Watch this space for the lecture notes.
Recent Comments
non-theory
theory
Archives
- May 2013
- April 2013
- March 2013
- November 2012
- August 2012
- July 2012
- June 2012
- May 2012
- February 2012
- January 2012
- December 2011
- November 2011
- September 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- July 2009
- June 2009
- May 2009
- April 2009
- March 2009
- February 2009
- January 2009
- December 2008
- November 2008
- October 2008
- September 2008
- August 2008
- July 2008
- June 2008
- May 2008
- April 2008
- March 2008
- February 2008
- January 2008
- December 2007
- November 2007
- October 2007
- September 2007
- August 2007
- July 2007
- June 2007
- May 2007
- April 2007
- March 2007
- February 2007
- January 2007
- December 2006
- November 2006
- October 2006
- September 2006
- August 2006
- July 2006
- June 2006
- May 2006
- April 2006
- March 2006
a
Tags
Additive Combinatorics
Apple
Avi Wigderson
CCA security
circuit lower bounds
Conceptual contributions
cryptography
CS254 2010
eigenvalues
Expanders
Fields Medal
FOCS 2006
FOCS 2010
Hard-Core Sets
ICM 2006
Integrality gap
Leonid Levin
linear programming
Luby-Rackoff
maximum flow
Metric embeddings
Oded Goldreich
Proposition 8
pseudorandom function
Pseudorandomness
pseudorandom permutation
public-key encryption
quadratic residue
Random Oracle Model
Regularity Lemma
RSA
SAT
signature schemes
sparsest cut
Spectral partitioning
STOC and FOCS
Szemeredi Theorem
Tamar Ziegler
Terence Tao
things that are excellent
Tim Gowers
Turing Centennial
unique games
World Cup
Zero Knowledge
2 comments
Comments feed for this article
April 2, 2010 at 7:38 am
Micha
Nothing on descriptive complexity? How sad!
(Later in this thread, more “Nothing on …? How sad!”)
April 6, 2010 at 11:26 am
droope
only? 17 lectures?
Regards,
Droope