skip to main | skip to sidebar

18-859S: Analysis of Boolean Functions

The course blog for Carnegie Mellon Computer Science course 18-859S, offered in Spring 2007 with instructor Ryan O'Donnell.

Thursday, February 22, 2007

Homework #2 solutions

Are posted on the course web page.
Posted by Ryan O'Donnell at 5:50 PM

2 comments:

Anonymous said...

Can you give us a nice proof for the Bonus question?

2/22/2007 9:12 PM
Ryan O'Donnell said...

We'll see it in class.

2/25/2007 6:05 PM

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

About Me

Ryan O'Donnell
View my complete profile

Blog Archive

  • ▼  2007 (49)
    • ►  May (5)
    • ►  April (8)
    • ►  March (11)
    • ▼  February (14)
      • Homework 3
      • Homework 2 graded
      • Learning low-degree polynomials over GF(2)
      • Condorcet on Randomized Voting
      • Homework #2 solutions
      • The rationality of weakly symmetric functions
      • Learning juntas
      • What's new in Fourier Analysis?
      • Homework #2
      • Sampling
      • Homework #2 is out
      • On quasirandomness
      • Homework 1 graded
      • Hardness via Unique Games Conjecture
    • ►  January (11)
  • ►  2006 (1)
    • ►  December (1)