Recent Comments
-
Recent Posts
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky’s conjectures
- Nostalgia corner: John Riordan’s referee report of my first paper
- At the Movies III: Picture a Scientist
- At the Movies II: Kobi Mizrahi’s short movie White Eye makes it to the Oscar’s short list.
- And the Oscar goes to: Meir Feder, Zvi Reznic, Guy Dorman, and Ron Yogev
- Thomas Vidick: What it is that we do
- To cheer you up in difficult times 20: Ben Green presents super-polynomial lower bounds for off-diagonal van der Waerden numbers W(3,k)
- To cheer you up in difficult times 19: Nati Linial and Adi Shraibman construct larger corner-free sets from better numbers-on-the-forehead protocols
- Possible future Polymath projects (2009, 2021)
Top Posts & Pages
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky's conjectures
- The Argument Against Quantum Computers - A Very Short Introduction
- Possible future Polymath projects (2009, 2021)
- 8866128975287528³+(-8778405442862239)³+(-2736111468807040)³
- TYI 30: Expected number of Dice throws
- Photonic Huge Quantum Advantage ???
- Jean
- ICM 2018 Rio (3) - Coifman, Goldstein, Kronheimer and Mrowka, and the Four Color Theorem
- Dan Romik on the Riemann zeta function
RSS
Tag Archives: Adi Shraibman
To cheer you up in difficult times 19: Nati Linial and Adi Shraibman construct larger corner-free sets from better numbers-on-the-forehead protocols
What will be the next polymath project? click here for our previous post. Number on the forehead, communication complexity, and additive combinatorics Larger Corner-Free Sets from Better NOF Exactly-N Protocols, by Nati Linial and Adi Shraibman Abstract: A subset of … Continue reading
Posted in Combinatorics, Computer Science and Optimization
Tagged Adi Shraibman, Nati Linial
3 Comments