Monthly Archives: May 2015

Choongbum Lee proved the Burr-Erdős conjecture

Posted on May 22, 2015 by Gil Kalai

Let be a graph. The Ramsey number is the smallest such that whenever you color the edges of the complete graph with vertices with two colors blue and red, you can either find a blue copy or a red copy … Continue reading →

Posted in Combinatorics, Updates | Tagged Choongbum Lee, Ramsey theory | 2 Comments

More Reasons for Small Influence

Posted on May 13, 2015 by Gil Kalai

Readers of the big-league ToC blogs have already heard about the breakthrough paper An average-case depth hierarchy theorem for Boolean circuits by Benjamin Rossman, Rocco Servedio, and Li-Yang Tan. Here are blog reports on Computational complexity, on the Shtetl Optimized, and of Godel … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Open problems, Probability | 12 Comments

	fedja on Chess can be a Game of Lu…
	qm computing summer… on The Race to Quantum Technologi…
	Murat Aygen on Remote Blogging: Efficiency of…
	Gil Kalai on Chess can be a Game of Lu…
	fedja on Chess can be a Game of Lu…
	Solvig Kadison-Singe… on The Kadison-Singer Conjecture…
	Matthew Cory on Call for nominations for the O…
	Matthew Cory on The Race to Quantum Technologi…
	domotorp on Chess can be a Game of Lu…
	Gil Kalai on The Race to Quantum Technologi…
	Notes of the seminar… on Mind Boggling: Following the w…
	Optimal Colorful Tve… on Seven Problems Around Tverberg…

Monthly Archives: May 2015

Choongbum Lee proved the Burr-Erdős conjecture

More Reasons for Small Influence

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives