Clik here to view.
When did Majority become the stablest?
The fireworks happening over at Ryan O’Donnell’s blog reminded me of something that always puzzles me: Is Majority the Stablest? Or the Unstablest? Consider the class of all monotone, balanced Boolean...
View ArticleClik here to view.
When did Majority become the stablest? (Part 2)
The first question we’d like to answer is this: which is the monotone, balanced, transitive Boolean function which is least sensitive to bit-flips? We know that Majority is the worst possible with ....
View ArticleClik here to view.
The Switching Lemma
Hastad‘s Switching Lemma is one of the gems of computational complexity. The switching lemma analyzes the effect of random restrictions on circuits, which are constant depth circuits with AND, OR and...
View ArticleClik here to view.
Learning Juntas
Computational learning is full of problems that are deceptively simple to state but fiendishly hard to solve. Perhaps none more so than the problem of learning Juntas, posed by Avrim Blum and Pat...
View ArticleClik here to view.
On the importance of the alphabet
In my last post, we saw that the problem of learning juntas, hard as it is over Boolean inputs, seems even worse over other alphabets. Coding theory happens to have a inexhaustible supply of such...
View Article
