- Mathematical Gymnastics
- Media Item from “Haaretz” Today: “For the first time ever…”
- Jim Geelen, Bert Gerards, and Geoﬀ Whittle Solved Rota’s Conjecture on Matroids
- Media items on David, Amnon, and Nathan
- Next Week in Jerusalem: Special Day on Quantum PCP, Quantum Codes, Simplicial Complexes and Locally Testable Codes
- Happy Birthday Ervin, János, Péter, and Zoli!
- My Mathematical Dialogue with Jürgen Eckhoff
- Test Your Intuition (23): How Many Women?
- Happy Birthday Richard Stanley!
Top Posts & Pages
- Polymath 8 - a Success!
- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- Why is mathematics possible?
- Two Math Riddles
- The Ultimate Riddle
- Emmanuel Abbe: Erdal Arıkan's Polar Codes
- Why Quantum Computers Cannot Work: The Movie!
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Believing that the Earth is Round When it Matters
Tag Archives: Computational complexity
Scott Aaronson gave a thought-provoking lecture in our Theory seminar three weeks ago. (Actually, this was eleven months ago.) The slides are here . The lecture discussed two results regarding the computational power of quantum computers. One result from this paper gives an … Continue reading
The purpose of this post is to describe an old conjecture (or guesses, see this post) by Itai Benjamini, Oded Schramm and myself (taken from this paper) on noise stability of threshold functions. I will start by formulating the conjectures and … Continue reading