Monthly Archives: November 2018

PCP fest, Tel Aviv University, 18-20 December 2018

Posted on November 26, 2018 by Gil Kalai

Conference web site The study of Probabilistically Checkable Proofs, starting with the discovery of the PCP Theorem, is a cornerstone of modern computer science, with impact on complexity theory, algorithms, and cryptography. Born as a purely theoretical notion, mostly used … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Conferences, Updates | Tagged PCP | 1 Comment

	Avinoam Mann on To cheer you up in difficult t…
	Gil Kalai on At the Movies III: Picture a…
	Dana on At the Movies III: Picture a…
	Gil Kalai on Nostalgia corner: John Riordan…
	quasihumanist on Nostalgia corner: John Riordan…
	Avinoam Mann on To cheer you up in difficult t…
	Gil Kalai on To cheer you up in difficult t…
	Avinoam Mann on To cheer you up in difficult t…
	To cheer you up in d… on @HUJI
	To cheer you up in d… on To Cheer You Up in Difficult T…
	55 Best Computer Sci… on Possible future Polymath proje…
	Understanding The Ma… on TYI 30: Expected number of Dic…

Monthly Archives: November 2018

PCP fest, Tel Aviv University, 18-20 December 2018

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives