Recent Comments
David Román on Amazing: Erdős’ Unit Dis… David Román on Amazing: Erdős’ Unit Dis… David Román on The Ramanujan Challenge for… AI vyvrátila slavnou… on Amazing: Erdős’ Unit Dis… تحدي رامانوجان للذكا… on The Ramanujan Challenge for… mathematicalsilence on The Ramanujan Challenge for… Gil Kalai on Polymath Plus AI Vijay Vazirani on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Gil Kalai on Matching in NC and Local … rohitgurjar0 on Matching in NC and Local … Vijay Vazirani on Matching in NC and Local …
Monthly Archives: November 2018
PCP fest, Tel Aviv University, 18-20 December 2018
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
Combinatorics and more 
