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

	Gil Kalai on A small update from Israel and…
	Bee on When It Rains It Pours
	Gil Kalai on Or Ordentlich, Oded Regev and…
	Ali on To cheer you up in difficult t…
	Gll Better – M… on My Quantum Debate with Aram Ha…
	Gil Kalai on To cheer you up in difficult t…
	Gil Kalai on To cheer you up in difficult t…
	Vijay Vazirani on To cheer you up in difficult t…
	wdjoyner on To cheer you up in difficult t…
	Gil Kalai on To cheer you up in difficult t…
	John Baez on To cheer you up in difficult t…
	Gil Kalai on TYI44: “What Then, To Ra…

Monthly Archives: November 2018

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

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives