Difference between revisions of "Theory tea reading group"

From Cornell CS Wiki
Jump to: navigation, search
(Spectral graph theory)
(Spectral graph theory)
Line 9: Line 9:
 
'''In favor:'''
 
'''In favor:'''
 
* [[User:Jshi|Jshi]] ([[User talk:Jshi|talk]]) 16:13, 19 November 2013 (EST)
 
* [[User:Jshi|Jshi]] ([[User talk:Jshi|talk]]) 16:13, 19 November 2013 (EST)
* --[[User:Df365|Df365]] ([[User talk:Df365|talk]]) 22:55, 19 November 2013 (EST)
+
* [[User:Df365|Df365]] ([[User talk:Df365|talk]]) 22:55, 19 November 2013 (EST)
  
 
=== Analysis of boolean functions ===
 
=== Analysis of boolean functions ===

Revision as of 22:55, 19 November 2013

Possible topics

Sign your comments with this string of characters on the edit page:

 --~~~~


Spectral graph theory

Dan Spielman's notes here: http://www.cs.yale.edu/homes/spielman/561/

In favor:

  • Jshi (talk) 16:13, 19 November 2013 (EST)
  • Df365 (talk) 22:55, 19 November 2013 (EST)

Analysis of boolean functions

Ryan O'Donnell's book here: http://analysisofbooleanfunctions.org/

In favor:

  • I'd like to know more about fourier analysis and polynomials in this context. --Jshi (talk) 16:13, 19 November 2013 (EST)
  • Ditto. Reitblatt (talk) 17:08, 19 November 2013 (EST)

Error-correcting codes and PCPs

i.e. http://arxiv.org/abs/1111.0405

In favor:

  • Jshi (talk) 16:13, 19 November 2013 (EST)


Quantum computing

I can lead one or two survey discussions on this topic. --Jshi (talk) 16:13, 19 November 2013 (EST)

  • I would love that! I wanted to take the class in the spring, but won't due to the clash with Approx - so would be a big supporter of that idea as well! --Df365 (talk) 22:55, 19 November 2013 (EST)